Hoogle Search
Within LTS Haskell 24.62 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
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.
fromNormalizedRangeList :: [(Int, Int)] -> RIntSetrange-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.
fromRList :: RSet Int -> RIntSetrange-set-list Data.RangeSet.IntMap fromRangeList :: [(Int, Int)] -> RIntSetrange-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.
-
range-set-list Data.RangeSet.IntMap O(n*r). Convert the set to an ascending list of elements.
-
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.
toRList :: RIntSet -> RSet Intrange-set-list Data.RangeSet.IntMap toRangeList :: RIntSet -> [(Int, Int)]range-set-list Data.RangeSet.IntMap O(n). Convert the set to a list of range pairs.
complementRangeList :: (Ord a, Enum a, Bounded a) => [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Compute the complement.
deleteRangeList :: (Ord a, Enum a) => a -> a -> [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Remove a range from a range list. There are 6 possibilities we consider, when deleting from non-empty set:
- more
- less
- strictly inside (splits)
- overlapping less-edge
- overlapping more-edge
- stricly larger