From 47f611e7b8d2ff95a3ff795574798b4e24a6719d Mon Sep 17 00:00:00 2001 From: Adam Ierymenko Date: Tue, 9 Jul 2013 22:24:50 -0400 Subject: Add bloom filter as separate code, work in progress factoring out multicast algorithm from the bloated Switch class. --- node/Utils.hpp | 32 -------------------------------- 1 file changed, 32 deletions(-) (limited to 'node/Utils.hpp') diff --git a/node/Utils.hpp b/node/Utils.hpp index 5cdf10de..4b7d6be8 100644 --- a/node/Utils.hpp +++ b/node/Utils.hpp @@ -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 * -- cgit v1.2.3