1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/*
Ray
Copyright (C) 2011, 2012 Sébastien Boisvert
http://DeNovoAssembler.SourceForge.Net/
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, version 3 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You have received a copy of the GNU General Public License
along with this program (gpl-3.0.txt).
see <http://www.gnu.org/licenses/>
*/
#ifndef _BloomFilter_H
#define _BloomFilter_H
#include "Kmer.h"
#include <stdint.h>
/**
* Bloom filter implementation
* This is a drop-in replacement thanks to the KmerAcademy design.
* \see http://en.wikipedia.org/wiki/Bloom_filter
* \author Sébastien Boisvert
*/
class BloomFilter{
/** the bits */
uint64_t*m_bitmap;
/** the number of bits */
uint64_t m_bits;
/**
* Number of used bits
*/
uint64_t m_numberOfSetBits;
uint64_t m_numberOfInsertions;
/** the number of hash functions */
int m_hashFunctions;
/** a random number for each hash function */
uint64_t m_hashNumbers[8];
public:
/** initialize the filter */
void constructor(uint64_t bits);
/** check for a value */
bool hasValue(Kmer*kmer);
/** check is a value was inserted. false positive rate is not 0 */
void insertValue(Kmer*kmer);
/** destroy the BloomFilter */
void destructor();
uint64_t getNumberOfBits();
uint64_t getNumberOfSetBits();
uint64_t getNumberOfInsertions();
};
#endif
|
