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 a -> [(Interval k, a)]

   data-interval	Data.IntervalMap.Lazy

   Convert the map to a list of key/value pairs where the keys are in descending order.

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

   data-interval	Data.IntervalMap.Lazy

   Convert the map to a list of key/value pairs.

3. fromList :: Ord k => [(Interval k, a)] -> IntervalMap k a

   data-interval	Data.IntervalMap.Strict

   Build a map from a list of key/value pairs. If the list contains more than one value for the same key, the last value for the key is retained.

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

   data-interval	Data.IntervalMap.Strict

   Build a map from a list of key/value pairs with a combining function.

5. toAscList :: IntervalMap k a -> [(Interval k, a)]

   data-interval	Data.IntervalMap.Strict

   Convert the map to a list of key/value pairs where the keys are in ascending order.

6. toDescList :: IntervalMap k a -> [(Interval k, a)]

   data-interval	Data.IntervalMap.Strict

   Convert the map to a list of key/value pairs where the keys are in descending order.

7. toList :: IntervalMap k a -> [(Interval k, a)]

   data-interval	Data.IntervalMap.Strict

   Convert the map to a list of key/value pairs.

8. fromAscList :: Ord r => [Interval r] -> IntervalSet r

   data-interval	Data.IntervalSet

   Build a map from an ascending list of intervals. The precondition is not checked.

9. fromList :: Ord r => [Interval r] -> IntervalSet r

   data-interval	Data.IntervalSet

   Build a interval set from a list of intervals.

10. toAscList :: Ord r => IntervalSet r -> [Interval r]

    data-interval	Data.IntervalSet

    Convert a interval set into a list of intervals in ascending order.

Page 191 of many | Previous | Next