1/* 2 * Copyright (c) 2019 Inria 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 * 28 * Authors: Daniel Carvalho 29 */ 30 31#ifndef __BASE_FILTERS_PERFECT_BLOOM_FILTER_HH__ 32#define __BASE_FILTERS_PERFECT_BLOOM_FILTER_HH__ 33 34#include <unordered_set> 35 36#include "base/filters/base.hh" 37 38struct BloomFilterPerfectParams; 39 40namespace BloomFilter { 41 42/** 43 * A perfect bloom filter with no false positives nor false negatives. 44 */ 45class Perfect : public Base 46{ 47 public: 48 Perfect(const BloomFilterPerfectParams* p); 49 ~Perfect(); 50 51 void clear() override; 52 void set(Addr addr) override; 53 void unset(Addr addr) override; 54 55 void merge(const Base* other) override; 56 int getCount(Addr addr) const override; 57 int getTotalCount() const override; 58 59 private: 60 /** Container storing all set (seen) entries. */ 61 std::unordered_set<Addr> entries; 62}; 63 64} // namespace BloomFilter 65 66#endif // __BASE_FILTERS_PERFECT_BLOOM_FILTER_HH__ 67