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.
hashList64 :: Storable a => [a] -> Word64 -> IO Word64bloomfilter Data.BloomFilter.Hash Compute a 64-bit hash of a list of Storable instances.
fromList :: Int -> [a] -> BQueue abounded-queue Data.Queue.Bounded Naively keeps the first <math> values of the input list (as defined by the given limiting Int value) and does not attempt any elegant queue-like cycling.
fromList :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie 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 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 Convert a trie into a list using a function. Resulting values are in key-sorted order. Warning: This function suffers Bug #25.
fromListL :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A left-fold version of fromList. If you run into issues with stack overflows when using fromList or fromListR, then you should use this function instead.
fromListR :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience An explicitly right-fold variant of fromList. It is a good consumer for list fusion. Worst-case behavior is somewhat worse than worst-case for fromListL. The fromList function is currently just an alias for fromListR.
fromListS :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience This variant sorts the list before folding over it. This adds <math> overhead and requires the whole list be in memory at once, but it ensures that the list is in best-case order. The benefits generally outweigh the costs.
fromListWith :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListR that takes a function for combining values on conflict. The first argument to the combining function is the "new" value from the initial portion of the list; the second argument is the value that has been accumulated into the trie from the tail of the list (just like the first argument to foldr). Thus, fromList = fromListWith const.
fromListWith' :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListWith which applies the combining function strictly. This function is a good consumer for list fusion. If you need list fusion and are running into stack overflow problems with fromListWith, then this function may solve the problem.