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.
intersectRangeList :: Ord a => [(a, a)] -> [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Compute the intersection.
isSubsetRangeList :: Ord a => [(a, a)] -> [(a, a)] -> Boolrange-set-list Data.RangeSet.Internal Determine if the first list is a subset of the second.
normalizeRangeList :: (Ord a, Enum a) => [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Normalize an arbitrary list of ranges.
rangeIsSubsetList :: Ord a => a -> a -> [(a, a)] -> Maybe [(a, a)]range-set-list Data.RangeSet.Internal Determine if [x,y] is a subset of the list, returning the list right of y if so.
unionRangeList :: (Ord a, Enum a) => [(a, a)] -> [(a, a)] -> [(a, a)]range-set-list Data.RangeSet.Internal Union two range lists.
validRangeList :: (Ord a, Enum a, Bounded a) => [(a, a)] -> Boolrange-set-list Data.RangeSet.Internal Check if a list is normalized.
fromAscList :: (Ord a, Enum a) => [a] -> RSet arange-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.
fromList :: (Ord a, Enum a) => [a] -> RSet arange-set-list Data.RangeSet.List O(n*log n). Create a set from a list of elements.
fromNormalizedRangeList :: [(a, a)] -> RSet arange-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.
fromRangeList :: (Ord a, Enum a) => [(a, a)] -> RSet arange-set-list Data.RangeSet.List O(n*log n). Create a set from a list of range pairs.