Lines Matching refs:DiscreteOrdered

44 newtype DiscreteOrdered v => RSet v = RSet {rSetRanges :: [Range v]}  function
48 instance DiscreteOrdered a => Semigroup (RSet a) where
51 instance DiscreteOrdered a => Monoid (RSet a) where
55 instance DiscreteOrdered a => Monoid (RSet a) where
62 validRangeList :: DiscreteOrdered v => [Range v] -> Bool
74 normaliseRangeList :: DiscreteOrdered v => [Range v] -> [Range v]
80 normalise :: DiscreteOrdered v => [Range v] -> [Range v]
96 makeRangedSet :: DiscreteOrdered v => [Range v] -> RSet v
102 unsafeRangedSet :: DiscreteOrdered v => [Range v] -> RSet v
106 rSingleton :: DiscreteOrdered v => v -> RSet v
110 rSetIsEmpty :: DiscreteOrdered v => RSet v -> Bool
115 rSetIsFull :: DiscreteOrdered v => RSet v -> Bool
120 rSetHas, (-?-) :: DiscreteOrdered v => RSet v -> v -> Bool
134 rSetIsSubset, (-<=-) :: DiscreteOrdered v => RSet v -> RSet v -> Bool
142 rSetIsSubsetStrict, (-<-) :: DiscreteOrdered v => RSet v -> RSet v -> Bool
150 rSetUnion, (-\/-) :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
165 rSetIntersection, (-/\-) :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
180 rSetDifference, (-!-) :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
186 rSetNegation :: DiscreteOrdered a => RSet a -> RSet a
201 rSetEmpty :: DiscreteOrdered a => RSet a
205 rSetFull :: DiscreteOrdered a => RSet a
209 rSetUnfold :: DiscreteOrdered a =>