Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. prop_union_superset :: DiscreteOrdered a => RSet a -> RSet a -> Bool

   Ranged-sets	Data.Ranged.RangedSet

   The union of two sets is the non-strict superset of both.

   prop_union_superset rs1 rs2 =
   rs1 -<=- u && rs2 -<=- u
   where
   u = rs1 -\/- rs2
   

2. rSetDifference :: DiscreteOrdered v => RSet v -> RSet v -> RSet v

   Ranged-sets	Data.Ranged.RangedSet

   Set difference. Infix precedence is left 6.

3. rSetEmpty :: DiscreteOrdered a => RSet a

   Ranged-sets	Data.Ranged.RangedSet

   The empty set.

4. rSetFull :: DiscreteOrdered a => RSet a

   Ranged-sets	Data.Ranged.RangedSet

   The set that contains everything.

5. rSetHas :: DiscreteOrdered v => RSet v -> v -> Bool

   Ranged-sets	Data.Ranged.RangedSet

   True if the value is within the ranged set. Infix precedence is left 5.

6. rSetIntersection :: DiscreteOrdered v => RSet v -> RSet v -> RSet v

   Ranged-sets	Data.Ranged.RangedSet

   Set intersection for ranged sets. Infix precedence is left 7.

7. rSetIsEmpty :: DiscreteOrdered v => RSet v -> Bool

   Ranged-sets	Data.Ranged.RangedSet

   True if the set has no members.

8. rSetIsFull :: DiscreteOrdered v => RSet v -> Bool

   Ranged-sets	Data.Ranged.RangedSet

   True if the negation of the set has no members.

9. rSetIsSubset :: DiscreteOrdered v => RSet v -> RSet v -> Bool

   Ranged-sets	Data.Ranged.RangedSet

   True if the first argument is a subset of the second argument, or is equal. Infix precedence is left 5.

10. rSetIsSubsetStrict :: DiscreteOrdered v => RSet v -> RSet v -> Bool

    Ranged-sets	Data.Ranged.RangedSet

    True if the first argument is a strict subset of the second argument. Infix precedence is left 5.

Page 221 of many | Previous | Next