···55 "Bloom filters are probabilistic data structures for membership testing. A positive result means the element may be in the set, while a negative result means it is definitely not."
66maintainer: ["Thomas Gazagnaire"]
77authors: ["Clément Pascutto" "Thomas Gazagnaire"]
88+tags: ["org:blacksun" "storage"]
89homepage: "https://tangled.org/gazagnaire.org/ocaml-bloom"
910bug-reports: "https://tangled.org/gazagnaire.org/ocaml-bloom/issues"
1011depends: [