Hoogle Search
Within LTS Haskell 24.37 (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*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
differenceRangeList :: (Ord a, Enum a) => [(a, a)] -> [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Compute the set difference, removing each range in the second list from the first.
fromAscElemList :: (Eq a, Enum a) => [a] -> [(a, a)]range-set-list Data.RangeSet.Internal Normalize a sorted list of elements to a range list.
fromElemList :: (Ord a, Enum a) => [a] -> [(a, a)]range-set-list Data.RangeSet.Internal Normalize an arbitrary list of elements to a range list.
insertRangeList :: (Ord a, Enum a) => a -> a -> [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Add [x,y]. There are three possibilities we consider, when inserting into non-empty set:
- discretely after: continue
- discretely before: prepend
- overlapping: union and prepend