Ranged-sets-0.2.0: Ranged sets for HaskellContentsIndex
Search:
-!-
-/\-
-<-
-<=-
-?-
-\/-
/>/
above
adjacent
adjacentBelow
Boundary
BoundaryAbove
BoundaryAboveAll
BoundaryBelow
BoundaryBelowAll
boundedAdjacent
boundedBelow
DiscreteOrdered
emptyRange
enumAdjacent
fullRange
makeRangedSet
normaliseRangeList
prop_de_morgan_intersection
prop_de_morgan_union
prop_difference
prop_differenceRange
prop_diff_intersect
prop_empty
prop_emptyNonSingleton
prop_empty_intersection
prop_enclosureUnion
prop_full
prop_fullNonSingleton
prop_full_union
prop_has
prop_intersection
prop_intersectionOverlap
prop_intersectionRange
prop_intersection_associates
prop_intersection_commutes
prop_intersection_subset
prop_intSingleton
prop_negation
prop_nonSingleton
prop_not_empty
prop_singletonRangeConverse
prop_singletonRangeHas
prop_singletonRangeHasOnly
prop_strict_subset
prop_subset
prop_unfold
prop_union
prop_unionRange
prop_unionRangeLength
prop_union_associates
prop_union_commutes
prop_union_strict_superset
prop_union_superset
prop_validNormalised
Range
1 (Data Constructor)
2 (Type/Class)
rangeDifference
rangeEncloses
rangeHas
rangeIntersection
rangeIsEmpty
rangeIsFull
rangeListHas
rangeLower
rangeOverlap
rangeSingletonValue
rangeUnion
rangeUpper
RSet
rSetDifference
rSetEmpty
rSetFull
rSetHas
rSetIntersection
rSetIsEmpty
rSetIsFull
rSetIsSubset
rSetIsSubsetStrict
rSetNegation
rSetRanges
rSetUnfold
rSetUnion
rSingleton
singletonRange
unsafeRangedSet
validRangeList