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.
fromListWithL :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A left-fold variant of fromListWith. Note that the arguments to the combining function are swapped: the first is the value in the trie which has been accumulated from the initial part of the list; the second argument is the "new" value from the remaining tail of the list (just like the first argument to foldl). Thus, fromListL = fromListWithL const.
fromListWithL' :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListWithL which applies the combining function strictly.
fromList :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Internal Convert association list into a trie. On key conflict, values earlier in the list shadow later ones.
toList :: Trie a -> [(ByteString, a)]bytestring-trie Data.Trie.Internal Convert trie into association list. The list is ordered according to the keys. Warning: This function suffers Bug #25.
toListBy :: (ByteString -> a -> b) -> Trie a -> [b]bytestring-trie Data.Trie.Internal Convert a trie into a list using a function. Resulting values are in key-sorted order. Warning: This function suffers Bug #25.
fromList :: Uniquable a => [(a, b)] -> UniqMap bclash-lib Clash.Data.UniqMap Convert a list of key-value pairs to a map.
toList :: UniqMap b -> [(Unique, b)]clash-lib Clash.Data.UniqMap Convert a map to a list of unique-value pairs.
fromList :: (Edge e, Ord n) => [LabeledNode n nl] -> [LabeledEdge e n el] -> Graph e n el nlcomfort-graph Data.Graph.Comfort No documentation available.
fromList :: Ord k => [v] -> (v -> k) -> CompactMap k vcompactmap Data.CompactMap No documentation available.
-
compactmap Data.CompactMap.Generic No documentation available.