git-annex/Utility/Bloom.hs

41 lines
855 B
Haskell
Raw Normal View History

2023-03-14 02:39:16 +00:00
{- bloomfilter compatibility wrapper
-
- Copyright 2014 Joey Hess <id@joeyh.name>
-
- License: BSD-2-clause
-}
module Utility.Bloom (
Bloom,
safeSuggestSizing,
2015-06-16 22:37:41 +00:00
Hashable(..),
cheapHashes,
elemB,
notElemB,
newMB,
insertMB,
unsafeFreezeMB,
) where
import qualified Data.BloomFilter.Mutable as MBloom
import qualified Data.BloomFilter as Bloom
import Data.BloomFilter.Easy (safeSuggestSizing, Bloom)
2015-06-16 22:37:41 +00:00
import Data.BloomFilter.Hash (Hashable(..), cheapHashes)
import Control.Monad.ST (ST)
notElemB :: a -> Bloom a -> Bool
notElemB = Bloom.notElem
elemB :: a -> Bloom a -> Bool
elemB = Bloom.elem
newMB :: (a -> [Bloom.Hash]) -> Int -> ST s (MBloom.MBloom s a)
newMB = MBloom.new
insertMB :: MBloom.MBloom s a -> a -> ST s ()
insertMB = MBloom.insert
unsafeFreezeMB :: MBloom.MBloom s a -> ST s (Bloom a)
unsafeFreezeMB = Bloom.unsafeFreeze