Add bloom filter as separate code, work in progress factoring out multicast algorithm from the bloated Switch class.
This commit is contained in:
parent
b14856da50
commit
47f611e7b8
2 changed files with 123 additions and 32 deletions
|
@ -460,38 +460,6 @@ public:
|
|||
return ((*aptr & mask) == (*aptr & mask));
|
||||
}
|
||||
|
||||
/**
|
||||
* Add a value to a bloom filter
|
||||
*
|
||||
* Note that bloom filter methods depend on n being evenly distributed, so
|
||||
* it's the job of the caller to implement any hashing.
|
||||
*
|
||||
* @param bits Bloom filter data (must be filterSize / 8 bytes in length)
|
||||
* @param filterSize Size of bloom filter in BITS
|
||||
* @param n Number to add
|
||||
*/
|
||||
static inline void bloomAdd(void *bits,unsigned int filterSize,unsigned int n)
|
||||
throw()
|
||||
{
|
||||
n %= filterSize;
|
||||
((unsigned char *)bits)[n / 8] |= (0x80 >> (n % 8));
|
||||
}
|
||||
|
||||
/**
|
||||
* Test for a value in a bloom filter
|
||||
*
|
||||
* @param bits Bloom filter data (must be filterSize / 8 bytes in length)
|
||||
* @param filterSize Size of bloom filter in BITS
|
||||
* @param n Number to test
|
||||
* @return True if number might be in filter
|
||||
*/
|
||||
static inline bool bloomContains(const void *bits,unsigned int filterSize,unsigned int n)
|
||||
throw()
|
||||
{
|
||||
n %= filterSize;
|
||||
return ((((const unsigned char *)bits)[n / 8] & (0x80 >> (n % 8))));
|
||||
}
|
||||
|
||||
/**
|
||||
* Compute CRC64
|
||||
*
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue