data_structures::BloomFilter< T > Class Template Reference

Bloom filter template class. More...

Collaboration diagram for data_structures::BloomFilter< T >:

Public Member Functions
	BloomFilter (std::size_t, std::initializer_list< std::function< std::size_t(T)> >)
	Constructor for Bloom filter.
void	add (T)
	Add function for Bloom filter.
bool	contains (T)
	Check element function for Bloom filter.

Private Attributes
Bitset	set
	inner bitset for elements
std::vector< std::function< std::size_t(T)> >	hashFunks
	hash functions for T type

Detailed Description

template<typename T>
class data_structures::BloomFilter< T >

Bloom filter template class.

Template Parameters

T	type of elements that we need to filter

Constructor & Destructor Documentation

BloomFilter()

template<typename T >

data_structures::BloomFilter< T >::BloomFilter	(	std::size_t	size,
		std::initializer_list< std::function< std::size_t(T)> >	funks )

Constructor for Bloom filter.

Template Parameters

T	type of elements that we need to filter

Parameters

size	initial size of Bloom filter
funks	hash functions for T type

Returns

none

    : set(size), hashFunks(funks) {}

Member Function Documentation

add()

template<typename T >

void data_structures::BloomFilter< T >::add

(

T

x

)

Add function for Bloom filter.

Template Parameters

T	type of elements that we need to filter

Parameters

x	element to add to filter

Returns

void

                            {
    for (std::size_t i = 0; i < hashFunks.size(); i++) {
        set.add(hashFunks[i](x) % (sizeof(std::size_t) * set.size()));
    }
}

Here is the call graph for this function:

contains()

template<typename T >

bool data_structures::BloomFilter< T >::contains

(

T

x

)

Check element function for Bloom filter.

Template Parameters

T	type of elements that we need to filter

Parameters

x	element to check in filter

Returns

true if the element probably appears in the filter

false if the element certainly does not appear in the filter

                                 {
    for (std::size_t i = 0; i < hashFunks.size(); i++) {
        if (set.contains(hashFunks[i](x) %
                         (sizeof(std::size_t) * set.size())) == false) {
            return false;
        }
    }
    return true;
}

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• data_structures/bloom_filter.cpp