Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. fromList :: forall ik k v . (Ord k, Ord ik, Enum ik, Bounded ik) => Proxy ik -> [(NonEmpty k, v)] -> MKMap k v

   yarn-lock	Data.MultiKeyedMap

   Build a map from a list of key/value pairs.

2. fromList :: [(BS, a)] -> Trie a

   zenacy-html	Zenacy.HTML.Internal.Trie

   Creates a trie from a list of tuples containing key and value.

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

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

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

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

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

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

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

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. fromList :: [Word8] -> ByteSet

    byteset	Data.ByteSet

    O(n). Create a byteset from a list of bytes.

Page 36 of many | Previous | Next