Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
SnapshotRepoList :: NonEmpty SnapshotRepoPattern -> SnapshotRepoSelectionbloodhound Database.Bloodhound.Common.Types No documentation available.
fromList :: (a -> [Hash]) -> Int -> [a] -> Bloom abloomfilter Data.BloomFilter Create an immutable Bloom filter, populating it from a list of values. Here is an example that uses the cheapHashes function from the Data.BloomFilter.Hash module to create a hash function that returns three hashes.
import Data.BloomFilter.Hash (cheapHashes) filt = fromList (cheapHashes 3) 1024 ["foo", "bar", "quux"]
insertList :: [a] -> Bloom a -> Bloom abloomfilter Data.BloomFilter Create a new Bloom filter from an existing one, with the given members added. This function may be expensive, as it is likely to cause the underlying bit array to be copied. Repeated applications of this function with itself are subject to fusion.
easyList :: Hashable a => Double -> [a] -> Bloom abloomfilter Data.BloomFilter.Easy Create a Bloom filter with the given false positive rate and members. The hash functions used are computed by the cheapHashes function from the Hash module.
hashList32 :: Storable a => [a] -> Word32 -> IO Word32bloomfilter Data.BloomFilter.Hash Compute a 32-bit hash of a list of Storable instances.
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.