dart_bloom_filter 1.0.0 copy "dart_bloom_filter: ^1.0.0" to clipboard
dart_bloom_filter: ^1.0.0 copied to clipboard

A 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.

Bloom Filter #

A 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 #

final items = [
    'roti',
    'kapda',
    'makaan',
    'credit card',
    'wifi',
    'snacks',
    'ghar ki roti',
    'bahar ki boti'
  ];

  final bloomy = BloomFilter.murmur(10, 0.001, 12345);

  for (String item in items) {
    print('Before Adding: is $item added? ${bloomy.contains(item: item)}');
    bloomy.add(item: item);
    print('After Adding: is $item added? ${bloomy.contains(item: item)}');
  }

Features #

  • Supports false positive probability control
  • Supports Murmur hash
  • Supports Serialization
4
likes
120
pub points
45%
popularity

Publisher

verified publishermanavgarg.in

A 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.

Repository (GitHub)
View/report issues

Documentation

API reference

License

BSD-3-Clause (LICENSE)

Dependencies

bit_array, json_annotation, murmurhash

More

Packages that depend on dart_bloom_filter