simple_bloom_filter 0.1.2

A simple bloom filter implementation in Dart. Bloom filters are a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.

decamelize 🎯

A simple Dart implementation of a bloom filter. Bloom filters are a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.

usage

var bloom = simple_bloom_filter(10000, 3);
bloom.add('hello world');
if (bloom.check('hello world') == true) {
    print('"hello world" PROBABLY exists...');
}

Features

• Choose size of bit array
• Choose number of hash functions

Features to come

• Better hash functions
• Choose false positive probability