Branch: Tag:

2015-01-28

2015-01-28 21:59:24 by Arne Goedeke <el@laramies.com>

ADT.Bloom: doc typo

2015-01-28 21:43:39 by Arne Goedeke <el@laramies.com>

ADT.Bloom: Added Bloom filter class for integers

2015-01-25

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

ADT.Bloom.Simple: byte order independent hashing for wide strings

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

ADT.Bloom.SValue: corrected comment

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

SipHash24: added byte order independent versions for wide strings

- the current siphash version does not know about wide strings, so
the hash value for wide strings depends on the byte order. added
versions for both 16 and 32 bit wide chars
- also replaced the manual little endian reading routines by the
get_unaligned_le64 macros, which generate much shorter code for
x86_64
- added siphash24_pike_string which will generate a byte order
independent hash value
- use siphash24_pike_string in ADT.Bloom.String

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.

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

ADT.Bloom.Simple: use byte order independent hashing

2014-11-16

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

ADT.Bloom.SValue: corrected comment

2014-11-16 21:17:48 by Arne Goedeke <el@laramies.com>

ADT.Bloom.Simple: byte order independent hashing for wide strings

2014-11-16 21:16:03 by Arne Goedeke <el@laramies.com>

SipHash24: added byte order independent versions for wide strings

- the current siphash version does not know about wide strings, so
the hash value for wide strings depends on the byte order. added
versions for both 16 and 32 bit wide chars
- also replaced the manual little endian reading routines by the
get_unaligned_le64 macros, which generate much shorter code for
x86_64
- added siphash24_pike_string which will generate a byte order
independent hash value
- use siphash24_pike_string in ADT.Bloom.String

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

ADT.Bloom.Simple: use byte order independent hashing

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.