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.

Exact lookup

1. SnapshotList :: NonEmpty SnapshotPattern -> SnapshotSelection

   bloodhound	Database.Bloodhound.Client.Cluster

   No documentation available.

2. SnapshotRepoList :: NonEmpty SnapshotRepoPattern -> SnapshotRepoSelection

   bloodhound	Database.Bloodhound.Client.Cluster

   No documentation available.

3. IndexList :: NonEmpty IndexName -> IndexSelection

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

4. NodeList :: NonEmpty NodeSelector -> NodeSelection

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

5. SnapshotList :: NonEmpty SnapshotPattern -> SnapshotSelection

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

6. SnapshotRepoList :: NonEmpty SnapshotRepoPattern -> SnapshotRepoSelection

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

7. fromList :: (a -> [Hash]) -> Int -> [a] -> Bloom a

   bloomfilter	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"]
   
   

8. insertList :: [a] -> Bloom a -> Bloom a

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

9. easyList :: Hashable a => Double -> [a] -> Bloom a

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

10. hashList32 :: Storable a => [a] -> Word32 -> IO Word32

    bloomfilter	Data.BloomFilter.Hash

    Compute a 32-bit hash of a list of Storable instances.

Page 187 of many | Previous | Next