clear(const char *seq, size_t seq_len) | btllib::KmerCountingBloomFilter< T > | inline |
clear(const std::string &seq) | btllib::KmerCountingBloomFilter< T > | inline |
clear(const uint64_t *hashes) | btllib::KmerCountingBloomFilter< T > | inline |
clear(const std::vector< uint64_t > &hashes) | btllib::KmerCountingBloomFilter< T > | inline |
contains(const char *seq, size_t seq_len) const | btllib::KmerCountingBloomFilter< T > | inline |
contains(const std::string &seq) const | btllib::KmerCountingBloomFilter< T > | inline |
contains(const uint64_t *hashes) const | btllib::KmerCountingBloomFilter< T > | inline |
contains(const std::vector< uint64_t > &hashes) const | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert(const char *seq, size_t seq_len) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert(const std::string &seq) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert(const uint64_t *hashes, T n=1) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert(const std::vector< uint64_t > &hashes, T n=1) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert_thresh(const char *seq, size_t seq_len, T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert_thresh(const std::string &seq, const T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert_thresh(const uint64_t *hashes, const T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
contains_insert_thresh(const std::vector< uint64_t > &hashes, const T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
get_bytes() const | btllib::KmerCountingBloomFilter< T > | inline |
get_counting_bloom_filter() | btllib::KmerCountingBloomFilter< T > | inline |
get_fpr(T threshold=1) const | btllib::KmerCountingBloomFilter< T > | inline |
get_hash_fn() const | btllib::KmerCountingBloomFilter< T > | inline |
get_hash_num() const | btllib::KmerCountingBloomFilter< T > | inline |
get_k() const | btllib::KmerCountingBloomFilter< T > | inline |
get_occupancy(T threshold=1) const | btllib::KmerCountingBloomFilter< T > | inline |
get_pop_cnt(T threshold=1) const | btllib::KmerCountingBloomFilter< T > | inline |
insert(const char *seq, size_t seq_len) | btllib::KmerCountingBloomFilter< T > | inline |
insert(const std::string &seq) | btllib::KmerCountingBloomFilter< T > | inline |
insert(const uint64_t *hashes, T n=1) | btllib::KmerCountingBloomFilter< T > | inline |
insert(const std::vector< uint64_t > &hashes, T n=1) | btllib::KmerCountingBloomFilter< T > | inline |
insert_contains(const char *seq, size_t seq_len) | btllib::KmerCountingBloomFilter< T > | inline |
insert_contains(const std::string &seq) | btllib::KmerCountingBloomFilter< T > | inline |
insert_contains(const uint64_t *hashes, T n=1) | btllib::KmerCountingBloomFilter< T > | inline |
insert_contains(const std::vector< uint64_t > &hashes, T n=1) | btllib::KmerCountingBloomFilter< T > | inline |
insert_thresh_contains(const char *seq, size_t seq_len, T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
insert_thresh_contains(const std::string &seq, const T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
insert_thresh_contains(const uint64_t *hashes, const T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
insert_thresh_contains(const std::vector< uint64_t > &hashes, const T threshold) | btllib::KmerCountingBloomFilter< T > | inline |
is_bloom_file(const std::string &path) | btllib::KmerCountingBloomFilter< T > | inlinestatic |
KmerCountingBloomFilter() | btllib::KmerCountingBloomFilter< T > | inline |
KmerCountingBloomFilter(size_t bytes, unsigned hash_num, unsigned k) | btllib::KmerCountingBloomFilter< T > | inline |
KmerCountingBloomFilter(const std::string &path) | btllib::KmerCountingBloomFilter< T > | inlineexplicit |
KmerCountingBloomFilter(const KmerCountingBloomFilter &)=delete (defined in btllib::KmerCountingBloomFilter< T >) | btllib::KmerCountingBloomFilter< T > | |
KmerCountingBloomFilter(KmerCountingBloomFilter &&)=delete (defined in btllib::KmerCountingBloomFilter< T >) | btllib::KmerCountingBloomFilter< T > | |
operator=(const KmerCountingBloomFilter &)=delete (defined in btllib::KmerCountingBloomFilter< T >) | btllib::KmerCountingBloomFilter< T > | |
operator=(KmerCountingBloomFilter &&)=delete (defined in btllib::KmerCountingBloomFilter< T >) | btllib::KmerCountingBloomFilter< T > | |
remove(const char *seq, size_t seq_len) | btllib::KmerCountingBloomFilter< T > | inline |
remove(const std::string &seq) | btllib::KmerCountingBloomFilter< T > | inline |
remove(const uint64_t *hashes) | btllib::KmerCountingBloomFilter< T > | inline |
remove(const std::vector< uint64_t > &hashes) | btllib::KmerCountingBloomFilter< T > | inline |
save(const std::string &path) | btllib::KmerCountingBloomFilter< T > | inline |