Branch: Tag:

2015-01-25

2015-01-25 11:09:40 by Arne Goedeke <el@laramies.com>

Added ADT.Bloom

Added several different Bloom filters. They all use the same base class
but differ in what keys they accept and how the hash functions are
constructed. Consult the documentation for more information.

Bloom filters can be faster than hash tables However, this speed
advantage is hard to get to from pike, due to the extra cost of
calling lfuns vs mapping lookups. Therefore, the only advantage
these bloom filters have over pike mappings is the much lower
memory footprint.

2014-11-16

2014-11-16 13:35:31 by Arne Goedeke <el@laramies.com>

Added ADT.Bloom

Added several different Bloom filters. They all use the same base class
but differ in what keys they accept and how the hash functions are
constructed. Consult the documentation for more information.

Bloom filters can be faster than hash tables However, this speed
advantage is hard to get to from pike, due to the extra cost of
calling lfuns vs mapping lookups. Therefore, the only advantage
these bloom filters have over pike mappings is the much lower
memory footprint.