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.

Exact lookup

1. fromAscList :: [Int] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   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.

2. fromList :: [Int] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   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.

3. fromNormalizedRangeList :: [(Int, Int)] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n). 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.

4. fromRList :: RSet Int -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n). Convert a list-based RSet to a map-based RIntSet.

5. fromRangeList :: [(Int, Int)] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n*log n). Create a set from a list of range pairs. 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.

6. toAscList :: RIntSet -> [Int]

   range-set-list	Data.RangeSet.IntMap

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

7. toList :: RIntSet -> [Int]

   range-set-list	Data.RangeSet.IntMap

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

8. toRList :: RIntSet -> RSet Int

   range-set-list	Data.RangeSet.IntMap

   O(n). Convert a map-based RIntSet to a list-based RSet.

9. toRangeList :: RIntSet -> [(Int, Int)]

   range-set-list	Data.RangeSet.IntMap

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

10. complementRangeList :: (Ord a, Enum a, Bounded a) => [(a, a)] -> [(a, a)]

    range-set-list	Data.RangeSet.Internal

    Compute the complement.

Page 214 of many | Previous | Next