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.
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
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.