Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

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

    Ranged-sets Data.Ranged.RangedSet

    Set difference. Infix precedence is left 6.

  2. rSetEmpty :: DiscreteOrdered a => RSet a

    Ranged-sets Data.Ranged.RangedSet

    The empty set.

  3. rSetFull :: DiscreteOrdered a => RSet a

    Ranged-sets Data.Ranged.RangedSet

    The set that contains everything.

  4. 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.

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

    Ranged-sets Data.Ranged.RangedSet

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

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

    Ranged-sets Data.Ranged.RangedSet

    True if the set has no members.

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

    Ranged-sets Data.Ranged.RangedSet

    True if the negation of the set has no members.

  8. 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.

  9. 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.

  10. rSetNegation :: DiscreteOrdered a => RSet a -> RSet a

    Ranged-sets Data.Ranged.RangedSet

    Set negation.

Page 220 of many | Previous | Next