dstromberg
95fe1bf5c8
A pylint change
|
%!s(int64=9) %!d(string=hai) anos | |
|---|---|---|
| Makefile | %!s(int64=10) %!d(string=hai) anos | |
| README | %!s(int64=11) %!d(string=hai) anos | |
| bloom_filter_mod.py | %!s(int64=9) %!d(string=hai) anos | |
| count-bits | %!s(int64=13) %!d(string=hai) anos | |
| gen-performance-graph | %!s(int64=10) %!d(string=hai) anos | |
| setup.py | %!s(int64=12) %!d(string=hai) anos | |
| test-bloom-filter | %!s(int64=10) %!d(string=hai) anos |
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 (MIT).
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