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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
#include "btllib/counting_bloom_filter.hpp"
#include "helpers.hpp"
#include <cstdio>
#include <iostream>
#include <string>
int
main()
{
std::cerr << "Testing CountingBloomFilter" << std::endl;
btllib::CountingBloomFilter8 cbf(1024 * 1024, 3);
cbf.insert({ 1, 10, 100 });
cbf.insert({ 1, 10, 100 });
cbf.insert({ 100, 200, 300 });
TEST_ASSERT_EQ(cbf.contains({ 1, 10, 100 }), 2);
TEST_ASSERT_EQ(cbf.contains({ 100, 200, 300 }), 1);
TEST_ASSERT_EQ(cbf.contains({ 1, 20, 100 }), 0);
auto filename = get_random_name(64);
cbf.save(filename);
btllib::CountingBloomFilter8::is_bloom_file(filename);
btllib::CountingBloomFilter8 cbf2(filename);
TEST_ASSERT_EQ(cbf2.contains({ 1, 10, 100 }), 2);
TEST_ASSERT_EQ(cbf2.contains({ 100, 200, 300 }), 1);
TEST_ASSERT_EQ(cbf2.contains({ 1, 20, 100 }), 0);
TEST_ASSERT_EQ(cbf2.contains_insert({ 9, 99, 999 }), 0);
TEST_ASSERT_EQ(cbf2.contains_insert({ 9, 99, 999 }), 1);
TEST_ASSERT_EQ(cbf2.insert_contains({ 9, 99, 999 }), 3);
TEST_ASSERT_EQ(cbf2.insert_contains({ 9, 99, 999 }), 4);
TEST_ASSERT_EQ(cbf2.contains_insert_thresh({ 9, 99, 999 }, 5), 4);
TEST_ASSERT_EQ(cbf2.contains_insert_thresh({ 9, 99, 999 }, 5), 5);
TEST_ASSERT_EQ(cbf2.contains_insert_thresh({ 9, 99, 999 }, 5), 5);
TEST_ASSERT_EQ(cbf2.insert_thresh_contains({ 9, 99, 999 }, 6), 6);
TEST_ASSERT_EQ(cbf2.insert_thresh_contains({ 9, 99, 999 }, 6), 6);
std::remove(filename.c_str());
std::string seq = "CACTATCGACGATCATTCGAGCATCAGCGACTG";
std::string seq2 = "GTAGTACGATCAGCGACTATCGAGCTACGAGCA";
TEST_ASSERT_EQ(seq.size(), seq2.size());
std::cerr << "Testing KmerCountingBloomFilter" << std::endl;
btllib::KmerCountingBloomFilter8 kbf(1024 * 1024, 4, seq.size() / 2);
kbf.insert(seq);
const auto expected = seq.size() - seq.size() / 2 + 1;
TEST_ASSERT_EQ(kbf.contains(seq), expected);
TEST_ASSERT_LE(kbf.contains(seq2), 1);
filename = get_random_name(64);
kbf.save(filename);
btllib::KmerCountingBloomFilter8 kbf2(filename);
TEST_ASSERT_EQ(kbf2.contains(seq), expected);
TEST_ASSERT_LE(kbf2.contains(seq2), 1);
TEST_ASSERT_EQ(kbf2.contains_insert(seq), expected);
TEST_ASSERT_EQ(kbf2.contains_insert(seq), expected * 2);
TEST_ASSERT_EQ(kbf2.insert_contains(seq), expected * 4);
TEST_ASSERT_EQ(kbf2.insert_contains(seq), expected * 5);
TEST_ASSERT_EQ(kbf2.contains_insert_thresh(seq, 6), expected * 5);
TEST_ASSERT_EQ(kbf2.contains_insert_thresh(seq, 6), expected * 6);
TEST_ASSERT_EQ(kbf2.contains_insert_thresh(seq, 6), expected * 6);
TEST_ASSERT_EQ(kbf2.insert_thresh_contains(seq, 7), expected * 7);
TEST_ASSERT_EQ(kbf2.insert_thresh_contains(seq, 7), expected * 7);
std::remove(filename.c_str());
btllib::KmerCountingBloomFilter8 kbf3(1024 * 1024, 3, 64);
uint64_t kbf3_hashes1[] = { 1, 10, 100 };
uint64_t kbf3_hashes2[] = { 100, 200, 300 };
uint64_t kbf3_hashes3[] = { 1, 20, 100 };
kbf3.insert(kbf3_hashes1);
kbf3.insert(kbf3_hashes1);
kbf3.insert(kbf3_hashes2);
TEST_ASSERT_EQ(kbf3.contains(kbf3_hashes1), 2);
TEST_ASSERT_EQ(kbf3.contains(kbf3_hashes2), 1);
TEST_ASSERT_EQ(kbf3.contains(kbf3_hashes3), 0);
std::cerr << "Testing KmerCountingBloomfilter with multiple threads"
<< std::endl;
std::vector<std::string> present_seqs;
std::vector<unsigned> inserts;
std::vector<std::string> absent_seqs;
for (size_t i = 0; i < 100; i++) {
present_seqs.push_back(get_random_seq(100));
inserts.push_back(get_random(1, 10));
absent_seqs.push_back(get_random_seq(100));
}
std::vector<std::string> present_seqs2 = present_seqs;
btllib::KmerCountingBloomFilter8 kbf_multithreads(100 * 1024 * 1024, 4, 100);
#pragma omp parallel shared( \
present_seqs, present_seqs2, inserts, absent_seqs, kbf_multithreads)
{
while (true) {
std::string seq;
unsigned insert_count;
bool end = false;
#pragma omp critical
{
if (present_seqs.empty()) {
end = true;
} else {
seq = present_seqs.back();
insert_count = inserts.back();
present_seqs.pop_back();
inserts.pop_back();
}
}
if (end) {
break;
}
for (size_t i = 0; i < insert_count; i++) {
kbf_multithreads.insert(seq);
}
}
}
unsigned false_positives = 0;
#pragma omp parallel shared(present_seqs, \
present_seqs2, \
inserts, \
absent_seqs, \
kbf_multithreads) \
reduction(+:false_positives)
{
while (true) {
std::string seq;
bool end = false;
#pragma omp critical
{
if (absent_seqs.empty()) {
end = true;
} else {
seq = absent_seqs.back();
absent_seqs.pop_back();
}
}
if (end) {
break;
}
false_positives += kbf_multithreads.contains(seq);
}
}
std::cerr << "False positives = " << false_positives << std::endl;
TEST_ASSERT_LT(false_positives, 10);
int more_than_1 = 0;
#pragma omp parallel shared(present_seqs, \
present_seqs2, \
inserts, \
absent_seqs, \
kbf_multithreads) \
reduction(+:more_than_1)
{
while (true) {
std::string seq;
bool end = false;
#pragma omp critical
{
if (present_seqs2.empty()) {
end = true;
} else {
seq = present_seqs2.back();
present_seqs2.pop_back();
}
}
if (end) {
break;
}
if (kbf_multithreads.contains(seq) > 1) {
more_than_1++;
}
TEST_ASSERT(kbf_multithreads.contains(seq));
}
}
std::cerr << "Seqs with more than 1 presence = " << more_than_1 << std::endl;
TEST_ASSERT_GT(more_than_1, 5);
return 0;
}
|
