Simple fast bloom filter based on apache parquet BlockSplitBloomFilter.
Simple fast bloom filter based on apache parquet BlockSplitBloomFilter.
(add-uuids! bf val-seq)
(bitset-size fb)
Return the length of the byte array underlying this bitset
Return the length of the byte array underlying this bitset
(bloom-filter n f)
Create a bloom filter.
Create a bloom filter. * 'n' - Number of distinct values. * 'f' - Value from 1.0-0.0, defaults to 0.01. False positive rate.
(bloom-filter->byte-array bf)
(byte-array->bloom-filter data)
(contains? bf obj)
(hash-obj obj)
Hash an object. If integer - return integer else serialize->bytes and hash those
Hash an object. If integer - return integer else serialize->bytes and hash those
(insert-hash! bf hc)
(insert-obj bf o)
(make-long-hash-predicate bf)
(make-obj-predicate bf)
(make-uuid-hasher)
(make-uuid-pred bf)
(serialize->bytes o)
Serialize an object to a byte array
Serialize an object to a byte array
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close