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

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

   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] -> IntervalSet k

   IntervalMap	Data.IntervalSet

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

4. fromDistinctAscList :: Interval k e => [k] -> IntervalSet k

   IntervalMap	Data.IntervalSet

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

5. fromList :: (Interval k e, Ord k) => [k] -> IntervalSet k

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

6. toAscList :: IntervalSet k -> [k]

   IntervalMap	Data.IntervalSet

   O(n). The list of all values contained in the set, in ascending order.

7. toDescList :: IntervalSet k -> [k]

   IntervalMap	Data.IntervalSet

   O(n). The list of all values in the set, in descending order.

8. toList :: IntervalSet k -> [k]

   IntervalMap	Data.IntervalSet

   O(n). The list of all values in the set, in no particular order.

9. fromList :: [a] -> Zipper a

   ListZipper	Data.List.Zipper

   fromList xs returns a zipper containing the elements of xs, focused on the first element.

10. fromListEnd :: [a] -> Zipper a

    ListZipper	Data.List.Zipper

    fromListEnd xs returns a zipper containing the elements of xs, focused just off the right end of the list.

Page 236 of many | Previous | Next