2016-12-09 14:08:03 +00:00
|
|
|
#ifndef BLOOM_FILTER_H_
|
|
|
|
#define BLOOM_FILTER_H_
|
|
|
|
#include <memory>
|
|
|
|
#include <cstdint>
|
|
|
|
|
|
|
|
namespace i2p
|
|
|
|
{
|
|
|
|
namespace util
|
|
|
|
{
|
|
|
|
|
2016-12-09 14:10:08 +00:00
|
|
|
/** @brief interface for bloom filter */
|
|
|
|
struct IBloomFilter
|
|
|
|
{
|
2016-12-09 14:08:03 +00:00
|
|
|
|
2016-12-09 14:10:08 +00:00
|
|
|
/** @brief destructor */
|
2016-12-09 18:42:00 +00:00
|
|
|
virtual ~IBloomFilter() {};
|
2016-12-09 14:10:08 +00:00
|
|
|
/** @brief add entry to bloom filter, return false if filter hit otherwise return true */
|
|
|
|
virtual bool Add(const uint8_t * data, std::size_t len) = 0;
|
|
|
|
/** @brief optionally decay old entries */
|
2016-12-09 18:42:00 +00:00
|
|
|
virtual void Decay() = 0;
|
2016-12-09 14:10:08 +00:00
|
|
|
};
|
2016-12-09 14:08:03 +00:00
|
|
|
|
2016-12-09 14:10:08 +00:00
|
|
|
typedef std::shared_ptr<IBloomFilter> BloomFilterPtr;
|
2016-12-09 14:08:03 +00:00
|
|
|
|
2016-12-09 14:10:08 +00:00
|
|
|
/** @brief create bloom filter */
|
|
|
|
BloomFilterPtr BloomFilter(std::size_t capacity = 1024 * 8);
|
2016-12-09 14:08:03 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|