#include <bloom_filter.hpp>
Definition at line 179 of file bloom_filter.hpp.
◆ bloom_type
◆ cell_type
◆ table_type
◆ bloom_filter() [1/3]
fc::bloom_filter::bloom_filter |
( |
| ) |
|
|
inline |
◆ bloom_filter() [2/3]
◆ bloom_filter() [3/3]
fc::bloom_filter::bloom_filter |
( |
const bloom_filter & |
filter | ) |
|
|
inline |
◆ ~bloom_filter()
virtual fc::bloom_filter::~bloom_filter |
( |
| ) |
|
|
inlinevirtual |
◆ clear()
void fc::bloom_filter::clear |
( |
| ) |
|
|
inline |
◆ compute_indices()
virtual void fc::bloom_filter::compute_indices |
( |
const bloom_type & |
hash, |
|
|
std::size_t & |
bit_index, |
|
|
std::size_t & |
bit |
|
) |
| const |
|
inlineprotectedvirtual |
◆ contains() [1/4]
bool fc::bloom_filter::contains |
( |
const char * |
data, |
|
|
const std::size_t & |
length |
|
) |
| const |
|
inline |
◆ contains() [2/4]
bool fc::bloom_filter::contains |
( |
const std::string & |
key | ) |
const |
|
inline |
◆ contains() [3/4]
template<typename T >
bool fc::bloom_filter::contains |
( |
const T & |
t | ) |
const |
|
inline |
◆ contains() [4/4]
virtual bool fc::bloom_filter::contains |
( |
const unsigned char * |
key_begin, |
|
|
const std::size_t |
length |
|
) |
| const |
|
inlinevirtual |
◆ contains_all()
template<typename InputIterator >
InputIterator fc::bloom_filter::contains_all |
( |
const InputIterator |
begin, |
|
|
const InputIterator |
end |
|
) |
| const |
|
inline |
◆ contains_none()
template<typename InputIterator >
InputIterator fc::bloom_filter::contains_none |
( |
const InputIterator |
begin, |
|
|
const InputIterator |
end |
|
) |
| const |
|
inline |
◆ effective_fpp()
double fc::bloom_filter::effective_fpp |
( |
| ) |
const |
|
inline |
◆ element_count()
unsigned long long int fc::bloom_filter::element_count |
( |
| ) |
const |
|
inline |
◆ generate_unique_salt()
void fc::bloom_filter::generate_unique_salt |
( |
| ) |
|
|
inlineprotected |
◆ hash_ap()
bloom_type fc::bloom_filter::hash_ap |
( |
const unsigned char * |
begin, |
|
|
std::size_t |
remaining_length, |
|
|
bloom_type |
hash |
|
) |
| const |
|
inlineprotected |
◆ hash_count()
std::size_t fc::bloom_filter::hash_count |
( |
| ) |
|
|
inline |
◆ insert() [1/5]
void fc::bloom_filter::insert |
( |
const char * |
data, |
|
|
const std::size_t & |
length |
|
) |
| |
|
inline |
◆ insert() [2/5]
template<typename InputIterator >
void fc::bloom_filter::insert |
( |
const InputIterator |
begin, |
|
|
const InputIterator |
end |
|
) |
| |
|
inline |
◆ insert() [3/5]
void fc::bloom_filter::insert |
( |
const std::string & |
key | ) |
|
|
inline |
◆ insert() [4/5]
template<typename T >
void fc::bloom_filter::insert |
( |
const T & |
t | ) |
|
|
inline |
◆ insert() [5/5]
void fc::bloom_filter::insert |
( |
const unsigned char * |
key_begin, |
|
|
const std::size_t & |
length |
|
) |
| |
|
inline |
◆ operator!()
bool fc::bloom_filter::operator! |
( |
| ) |
const |
|
inline |
◆ operator!=()
◆ operator&=()
◆ operator=()
◆ operator==()
bool fc::bloom_filter::operator== |
( |
const bloom_filter & |
f | ) |
const |
|
inline |
◆ operator^=()
◆ operator|=()
◆ size()
virtual unsigned long long int fc::bloom_filter::size |
( |
| ) |
const |
|
inlinevirtual |
◆ table()
const cell_type* fc::bloom_filter::table |
( |
| ) |
const |
|
inline |
◆ bit_table_
std::vector<unsigned char> fc::bloom_filter::bit_table_ |
◆ desired_false_positive_probability_
double fc::bloom_filter::desired_false_positive_probability_ |
◆ inserted_element_count_
unsigned long long int fc::bloom_filter::inserted_element_count_ |
◆ projected_element_count_
unsigned long long int fc::bloom_filter::projected_element_count_ |
◆ random_seed_
unsigned long long int fc::bloom_filter::random_seed_ |
◆ salt_
◆ salt_count_
unsigned int fc::bloom_filter::salt_count_ |
◆ table_size_
unsigned long long int fc::bloom_filter::table_size_ |
The documentation for this class was generated from the following file: