BinRoot/Haskell-Data-Analysis-Cookbook
1
1
Fork 0
mirror of https://github.com/BinRoot/Haskell-Data-Analysis-Cookbook.git synced 2024-08-16 09:50:30 +03:00
Code Issues Projects Releases Wiki Activity

Modified code to use current version of Data.BloomFilter

Browse Source
This commit is contained in:
Tong-Kiat Tan 2014-08-09 16:07:25 +08:00
parent 0b306e5de9
commit 7139954ce6
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Ch04/Code09_bloom/Main.hs
View File

@ -1,9 +1,9 @@
import Data.BloomFilter (fromListB, elemB, emptyB, insertB)
import qualified Data.BloomFilter as BF
import Data.BloomFilter.Hash (cheapHashes)
import Data.Map (Map, empty, insertWith)
import qualified Data.Map as Map
filt = fromListB (cheapHashes 3) 1024 ["foo", "bar", "quux"]
filt = BF.fromList (cheapHashes 3) 1024 ["foo", "bar", "quux"]
-- Using a Bloom filter
main = do
@ -11,8 +11,8 @@ main = do
print $ snd $ removeUniques strands
removeUniques strands = foldl bloomMapCheck (emptyBloom, emptyMap) strands
where emptyBloom = emptyB (cheapHashes 3) 1024
where emptyBloom = BF.empty (cheapHashes 3) 1024
emptyMap = empty :: Map String Int
bloomMapCheck (b, m) x
| elemB x b = (b, insertWith (+) x 1 m)
| otherwise = (insertB x b, m)
| BF.elem x b = (b, insertWith (+) x 1 m)
| otherwise = (BF.insert x b, m)