mirror of
https://github.com/zeek/zeek.git
synced 2025-10-08 01:28:20 +00:00
Changing the Bloom filter hashing so that it's independent of
CompositeHash. We do this by hashing values added to a BloomFilter another time more with a stable hash seeded only by either the filter's name or the global_hash_seed (or Bro's random() seed if neither is defined). I'm also adding a new bif bloomfilter_internal_state() that returns a string representation of a Bloom filter's current internal state. This is solely for writing tests that check that the filters end up consistent when seeded with the same value.
This commit is contained in:
parent
6c197fbebf
commit
2a0790c231
14 changed files with 157 additions and 59 deletions
|
@ -276,6 +276,13 @@ public:
|
|||
*/
|
||||
size_type FindNext(size_type i) const;
|
||||
|
||||
/** Computes a hash value of the internal representation.
|
||||
* This is mainly for debugging/testing purposes.
|
||||
*
|
||||
* @return The hash.
|
||||
*/
|
||||
size_t Hash() const;
|
||||
|
||||
/**
|
||||
* Serializes the bit vector.
|
||||
*
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue