Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. validRangeList :: (Ord a, Enum a, Bounded a) => [(a, a)] -> Bool

    range-set-list Data.RangeSet.Internal

    Check if a list is normalized.

  2. fromAscList :: (Ord a, Enum a) => [a] -> RSet a

    range-set-list Data.RangeSet.List

    O(n). Create a set from a list of ascending elements. The precondition is not checked. You may use valid to check the result.

  3. fromList :: (Ord a, Enum a) => [a] -> RSet a

    range-set-list Data.RangeSet.List

    O(n*log n). Create a set from a list of elements.

  4. fromNormalizedRangeList :: [(a, a)] -> RSet a

    range-set-list Data.RangeSet.List

    O(1). Convert a normalized, non-adjacent, ascending list of ranges to a set. The precondition is not checked. In general you should only use this function on the result of toRangeList or ensure valid on the result.

  5. fromRangeList :: (Ord a, Enum a) => [(a, a)] -> RSet a

    range-set-list Data.RangeSet.List

    O(n*log n). Create a set from a list of range pairs.

  6. toAscList :: Enum a => RSet a -> [a]

    range-set-list Data.RangeSet.List

    O(n*r). Convert the set to an ascending list of elements.

  7. toList :: Enum a => RSet a -> [a]

    range-set-list Data.RangeSet.List

    O(n*r). Convert the set to a list of elements. r is the size of longest range.

  8. toRangeList :: RSet a -> [(a, a)]

    range-set-list Data.RangeSet.List

    O(1). Convert the set to a list of range pairs.

  9. fromAscList :: (Ord a, Enum a) => [a] -> RSet a

    range-set-list Data.RangeSet.Map

    O(n). Create a set from a list of ascending elements. The precondition is not checked. You may use valid to check the result. Note that unlike Data.Set and other binary trees, this always requires a full traversal to create distinct, disjoint ranges before constructing the tree.

  10. fromList :: (Ord a, Enum a) => [a] -> RSet a

    range-set-list Data.RangeSet.Map

    O(n*log n). Create a set from a list of elements. Note that unlike Data.Set and other binary trees, this always requires a full sort and traversal to create distinct, disjoint ranges before constructing the tree.

Page 216 of many | Previous | Next