ejabberd-contrib/mod_pottymouth/deps/etbloom
Tom Quackenbush 8e1263c328
update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray.
2017-07-26 12:58:01 -04:00
..
src update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00
test update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00
.gitignore update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00
LICENSE.txt update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00
README.md update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00
rebar update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00
rebar.config update mod_pottymouth to work with ejabberd 17.04. replace etbloom hipe_bifs/bitarray with ferd/bitarray. 2017-07-26 12:58:01 -04:00

README.md

Erlang Bloom Filter

Based on Scalable Bloom Filters Paulo Sérgio Almeida, Carlos Baquero, Nuno Preguiça, David Hutchison Information Processing Letters Volume 101, Issue 6, 31 March 2007, Pages 255-261

Provides scalable bloom filters that can grow indefinitely while ensuring a desired maximum false positive probability. Also provides standard partitioned bloom filters with a maximum capacity. Bit arrays are dimensioned as a power of 2 to enable reusing hash values across filters through bit operations. Double hashing is used (no need for enhanced double hashing for partitioned bloom filters).