From 76cdcc99ce76452555819a2ba18638bea4557143 Mon Sep 17 00:00:00 2001 From: jwellbelove Date: Sat, 17 Jan 2015 13:58:34 +0000 Subject: [PATCH] Added Bloom filter --- bloom_filter.h | 198 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 198 insertions(+) create mode 100644 bloom_filter.h diff --git a/bloom_filter.h b/bloom_filter.h new file mode 100644 index 00000000..1a703224 --- /dev/null +++ b/bloom_filter.h @@ -0,0 +1,198 @@ +///\file + +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. + +Copyright(c) 2014 jwellbelove + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files(the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and / or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions : + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. +******************************************************************************/ + +#ifndef __ETL_BLOOM_FILTER__ +#define __ETL_BLOOM_FILTER__ + +#include "parameter_type.h" +#include "bitset.h" +#include "type_traits.h" +#include "log.h" +#include "power.h" + +///\defgroup bloom_filter bloom_filter +/// A Bloom filter +///\ingroup containers + +namespace etl +{ + namespace __private_bloom_filter__ + { + // Placeholder null hash for defaulted template parameters. + struct null_hash + { + template + size_t operator ()(T) + { + return 0; + } + }; + } + + //*************************************************************************** + /// An implementation of a bloom filter. + /// Allows up to three hashes to be defined. + /// Hashes must support the () operator and define 'argument_type'. + ///\tparam WIDTH The number of hash results that can be stored. + ///\tparam THash1 The first hash generator class. + ///\tparam THash2 The second hash generator class. If omitted, uses the null hash. + ///\tparam THash3 The third hash generator class. If omitted, uses the null hash. + /// The hash classes must define argument_type. + ///\ingroup bloom_filter + //*************************************************************************** + template + class bloom_filter + { + private: + + typedef typename etl::parameter_type::type parameter_t; + typedef __private_bloom_filter__::null_hash null_hash; + + public: + + static const size_t WIDTH = WIDTH_; + + //*************************************************************************** + /// Clears the bloom filter of all entries. + //*************************************************************************** + void clear() + { + flags.reset(); + } + + //*************************************************************************** + /// Adds a key to the filter. + ///\param key The key to add. + //*************************************************************************** + void add(parameter_t key) + { + flags.set(get_hash(key)); + + if (!etl::is_same::value) + { + flags.set(get_hash(key)); + } + + if (!etl::is_same::value) + { + flags.set(get_hash(key)); + } + } + + //*************************************************************************** + /// Tests a key to see if it exists in the filter. + ///\param key The key to test. + ///\return true if the key exists in the filter. + //*************************************************************************** + bool exists(parameter_t key) const + { + bool exists1 = flags[get_hash(key)]; + bool exists2 = true; + bool exists3 = true; + + // Do we have a second hash? + if (!etl::is_same::value) + { + exists2 = flags[get_hash(key)]; + } + + // Do we have a third hash? + if (!etl::is_same::value) + { + exists2 = flags[get_hash(key)]; + } + + return exists1 && exists2 && exists3; + } + + //*************************************************************************** + /// Returns the width of the Bloom filter. + //*************************************************************************** + size_t width() const + { + return WIDTH; + } + + //*************************************************************************** + /// Returns the percentage of usage. Range 0 to 100. + //*************************************************************************** + size_t usage() const + { + return (100 * count()) / WIDTH; + } + + //*************************************************************************** + /// Returns the number of filter flags set. + //*************************************************************************** + size_t count() const + { + return flags.count(); + } + + private: + + //*************************************************************************** + /// Gets the hash for the key. + ///\param key The key. + ///\return The hash value. + //*************************************************************************** + template + size_t get_hash(parameter_t key) const + { + const size_t mask = etl::power_of_2_round_up::value - 1; + + size_t hash = THash()(key); + + // Fold the hash down to fit the width. + size_t folded_hash = 0; + + size_t shift = etl::log2::value>::value; + + // Keep shifting down and XORing the lower bits. + while (hash >= WIDTH) + { + folded_hash ^= hash & mask; + hash >>= etl::log2::value>::value; + } + + // Fold the remaining bits. + folded_hash ^= hash; + + return folded_hash; + } + + /// The Bloom filter flags. + etl::bitset flags; + }; +} + +#endif +