Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

Exact lookup

1. toHList :: HListRep a xs => a -> HList xs

   web3-solidity	Data.Solidity.Event.Internal

   No documentation available.

2. fromList :: [String] -> Trie

   word-trie	Data.Trie

   Take a list of String and compress it into a Trie

3. toList :: Trie -> [String]

   word-trie	Data.Trie

   Take a trie and expand it into the strings that it represents

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

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

   yarn-lock	Data.MultiKeyedMap

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

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

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

   FenwickTree	Data.Tree.Fenwick

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

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

   FenwickTree	Data.Tree.Fenwick

   Extract a sorted list of inserted values from the tree.

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

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

Page 233 of many | Previous | Next