bloomfilter Release Rss Feed

Updated Release: 1.0 Production (Apr 09, 2009)

fatcat1111 — Wed, 16 Sep 2009 22:57:48 GMT

Simplified usage by providing secondary hash functions for strings and ints.
Added constructors to provide additional control for those that need it.
Improved calculation of optimal double-hashing function count and underlying data structure size.
Added a default false-positive rate (calculated based on capacity) for those that do not wish to pass one.
Now catching when a provided capacity and error rate would result in an overflow.
Added a readme to explain usage.

Released: 1.0 Production (Apr 09, 2009)

Wed, 16 Sep 2009 22:57:48 GMT

Simplified usage by providing secondary hash functions for strings and ints.
Added constructors to provide additional control for those that need it.
Improved calculation of optimal double-hashing function count and underlying data structure size.
Added a default false-positive rate (calculated based on capacity) for those that do not wish to pass one.
Now catching when a provided capacity and error rate would result in an overflow.
Added a readme to explain usage.

Updated Release: 1.0 Production (Apr 09, 2009)

fatcat1111 — Fri, 10 Apr 2009 16:46:27 GMT

Simplified usage by providing secondary hash functions for strings and ints.
Added constructors to provide additional control for those that need it.
Improved calculation of optimal double-hashing function count and underlying data structure size.
Added a default false-positive rate (calculated based on capacity) for those that do not wish to pass one.
Now catching when a provided capacity and error rate would result in an overflow.
Added a readme to explain usage.

Released: 1.0 Production (Apr 09, 2009)

Fri, 10 Apr 2009 16:46:27 GMT

Simplified usage by providing secondary hash functions for strings and ints.
Added constructors to provide additional control for those that need it.
Improved calculation of optimal double-hashing function count and underlying data structure size.
Added a default false-positive rate (calculated based on capacity) for those that do not wish to pass one.
Now catching when a provided capacity and error rate would result in an overflow.
Added a readme to explain usage.

UPDATED RELEASE: 0.1 Alpha (Jun 24, 2007)

Mon, 25 Jun 2007 00:53:02 GMT

Here's the initial release. Functional but there's room for improvement. * Employs generics to ensure that the objects are homogenous. * Requires that the callers supply one hash method other than GetHashCode(). * Works for input sets smaller than int.maxValue/2. When passing a capacity greater than that it miscalculates the best _k_ and _n_ values.

UPDATED RELEASE: 0.1 Alpha (Jun 24, 2007)

Mon, 25 Jun 2007 00:50:01 GMT

Here's the initial release. See the unit tests for an example. * Employs generics to ensure that the objects are homogenous. * Requires that the callers supply one hash method other than GetHashCode(). * Works for input sets smaller than int.maxValue/2. When passing a capacity greater than that it miscalculates the best _k_ and _n_ values.

CREATED RELEASE: 0.1 Alpha (Jun 24, 2007)

Mon, 25 Jun 2007 00:38:02 GMT

Here's the initial release, with unit tests (which also provide an example). * Employs generics to ensure that the objects are homogenous. * Requires that the callers supply one hash method other than GetHashCode(). * Works for input sets smaller than int.maxValue/2. When passing a capacity greater than that it miscalculates the best _k_ and _n_ values.