marx/bloom-filter @ ad5e7b213a9086feb27b42ab7b787f195fa62d98

Keine Beschreibung

dstromberg ad5e7b213a New this-pylint, now from external		vor 13 Jahren
Makefile	b77b4c8f6a Added setup.py and rules for using it in the Makefile	vor 13 Jahren
README	2c101e4dba Few minor README improvements	vor 13 Jahren
bloom_filter_mod.py	a59bfe300d Use 4 spaces intead of tabs	vor 13 Jahren
count-bits	5fb9908837 Larger blocks. Give a percentage of set/clear	vor 13 Jahren
gen-performance-graph	d056ab122e Open the database file even if it does not yet exist	vor 13 Jahren
setup.py	b77b4c8f6a Added setup.py and rules for using it in the Makefile	vor 13 Jahren
test-bloom-filter	74dd08743b A couple of python 3.x fixes	vor 13 Jahren
this-pylint.old	ad5e7b213a New this-pylint, now from external	vor 13 Jahren

		
				README
			
This bloom filter implementation:
1) Has a constructor that accepts a maximum comfortable number of members and maximum appropriate error (false positive) rate, and
   derives the fiddly bits from that; most bloom filter modules ask the enduser to specify the fiddly bits themselves.
2) Has a nice test suite, including checks for error rate.
3) Is in pure Python that'll run on CPython 2.x, CPython 3.x, PyPy or Jython.
4) Has a pair of simple, fast hash functions that give a good error rate - they're better than many of the alternatives,
   They're not Murmur or Jenkins, but the tests strongly suggest that they're working well.
5) Passes pylint and pep8.
6) Supports adding elements, testing for membership, and'ing sets and or'ing sets.

The code is derived from http://code.activestate.com/recipes/577686-bloom-filter/ and inherits that code's license.

For more about Bloom Filters:
http://en.wikipedia.org/wiki/Bloom_filter
http://spyced.blogspot.com/2009/01/all-you-ever-wanted-to-know-about.html