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.

Exact lookup

1. toList :: MKMap k v -> [(NonEmpty k, v)]

   yarn-lock	Data.MultiKeyedMap

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

2. fromList :: (a -> a -> Ordering) -> (a -> Val) -> [a] -> FTree a

   FenwickTree	Data.Tree.Fenwick

   Creates a tree from a list and helper functions: compare, and value.

3. toFreqList :: FTree a -> [(Double, a)]

   FenwickTree	Data.Tree.Fenwick

   Extract a sorted list of cumulative sums, and corresponding objects from the tree.

4. toList :: FTree a -> [a]

   FenwickTree	Data.Tree.Fenwick

   Extract a sorted list of inserted values from the tree.

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

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

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

   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.

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

   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.

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

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

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

   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.

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

    IntervalMap	Data.IntervalMap.Generic.Lazy

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

Page 233 of many | Previous | Next