Skip to content

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.

License

Notifications You must be signed in to change notification settings

sigmapie8/dart_bloom_filter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

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.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages