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.
fromListWithKey :: (Interval k e, Ord k) => (k -> a -> a -> a) -> [(k, a)] -> IntervalMap k aIntervalMap Data.IntervalMap.Strict O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.
toAscList :: IntervalMap k v -> [(k, v)]IntervalMap Data.IntervalMap.Strict O(n). The list of all key/value pairs contained in the map, in ascending order of keys.
toDescList :: IntervalMap k v -> [(k, v)]IntervalMap Data.IntervalMap.Strict O(n). The list of all key/value pairs contained in the map, in descending order of keys.
toList :: IntervalMap k v -> [(k, v)]IntervalMap Data.IntervalMap.Strict O(n). The list of all key/value pairs contained in the map, in no particular order.
fromAscList :: (Interval k e, Eq k) => [k] -> IntervalSet kIntervalMap Data.IntervalSet O(n). Build a set from an ascending list in linear time. The precondition (input list is ascending) is not checked.
fromDistinctAscList :: Interval k e => [k] -> IntervalSet kIntervalMap Data.IntervalSet O(n). Build a set from an ascending list of distinct elements in linear time. The precondition is not checked.
fromList :: (Interval k e, Ord k) => [k] -> IntervalSet kIntervalMap Data.IntervalSet O(n log n). Build a set from a list of elements. See also fromAscList. If the list contains duplicate values, the last value is retained.
toAscList :: IntervalSet k -> [k]IntervalMap Data.IntervalSet O(n). The list of all values contained in the set, in ascending order.
toDescList :: IntervalSet k -> [k]IntervalMap Data.IntervalSet O(n). The list of all values in the set, in descending order.
toList :: IntervalSet k -> [k]IntervalMap Data.IntervalSet O(n). The list of all values in the set, in no particular order.