Just another Common Lisp bloom filter implementation, enjoy it!
Basic usage:
(defvar abloom-filter (bf:make-bloom-filter))
;; adding an item
(bf:add abloom-filter 42)
;; checking if an item is member
(bf:lookup abloom-filter 42)
;; asking the current false positie rate
(bf:effective-fp-rate abloom-filter)Using other hash function:
;; for this to work you must add cl-murmurhash as a dependency
(defvar abloom-filter (bf:make-bloom-filter :hash-function 'murmurhash))Creating a bloom-filter with specific values:
(defvar abloom-filter (bf:make-bloom-filter :hash-function 'sxhash
:expected-number-of-elements 100
:expected-fp-rate 1/100))