Tor
0.4.7.0-alpha-dev
|
Data Fields | |
struct sipkey | key [BLOOMFILT_N_HASHES] |
bloomfilt_hash_fn | hashfn |
uint32_t | mask |
bitarray_t * | ba |
An address_set_t represents a set of tor_addr_t values. The implementation is probabilistic: false negatives cannot occur but false positives are possible.
A set of elements, implemented as a Bloom filter.
An digestset_t represents a set of 20-byte digest values. The implementation is probabilistic: false negatives cannot occur but false positives are possible.
Definition at line 24 of file bloomfilt.c.
bitarray_t* ba |
A bit array to implement the Bloom filter.
Definition at line 31 of file bloomfilt.c.
Referenced by bloomfilt_add(), and bloomfilt_probably_contains().
bloomfilt_hash_fn hashfn |
Function used to generate hashes
Definition at line 28 of file bloomfilt.c.
Referenced by bloomfilt_add(), and bloomfilt_probably_contains().
struct sipkey key[BLOOMFILT_N_HASHES] |
siphash keys to make BLOOMFILT_N_HASHES independent hashes for each items.
Definition at line 107 of file bloomfilt.c.
Referenced by bloomfilt_add(), and bloomfilt_probably_contains().
uint32_t mask |
One less than the number of bits in ba; always one less than a power of two.
Definition at line 29 of file bloomfilt.c.