Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. toDescList :: IntervalMap k v -> [(k, v)]

   IntervalMap	Data.IntervalMap.Lazy

   O(n). The list of all key/value pairs contained in the map, in descending order of keys.

2. toList :: IntervalMap k v -> [(k, v)]

   IntervalMap	Data.IntervalMap.Lazy

   O(n). The list of all key/value pairs contained in the map, in no particular order.

3. fromAscList :: (Interval k e, Eq k) => [(k, v)] -> IntervalMap k v

   IntervalMap	Data.IntervalMap.Strict

   O(n). Build a map from an ascending list in linear time. The precondition (input list is ascending) is not checked.

4. fromAscListWith :: (Interval k e, Eq k) => (a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Strict

   O(n). Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

5. fromAscListWithKey :: (Interval k e, Eq k) => (k -> a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Strict

   O(n). Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

6. fromDistinctAscList :: Interval k e => [(k, v)] -> IntervalMap k v

   IntervalMap	Data.IntervalMap.Strict

   O(n). Build a map from an ascending list of elements with distinct keys in linear time. The precondition is not checked.

7. fromList :: (Interval k e, Ord k) => [(k, v)] -> IntervalMap k v

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained.

8. fromListWith :: (Interval k e, Ord k) => (a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

9. fromListWithKey :: (Interval k e, Ord k) => (k -> a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

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

Page 235 of many | Previous | Next