Blocked Bloom filter: bulk insert (faster only in the 100m case, and only about 10%)

thomasmueller · thomasmueller · commit 7449f3ee28a7 · 2018-10-24T22:01:33.000+02:00
diff --git a/benchmarks/bulk-insert-and-query.cc b/benchmarks/bulk-insert-and-query.cc
@@ -889,9 +889,9 @@ int main(int argc, char * argv[]) {
   }
 
 #ifdef __AVX2__
-  if (algorithmId == 40 || algorithmId < 0) {
+  if (algorithmId == 40 || algorithmId < 0 || (algos.find(40) != algos.end())) {
       auto cf = FilterBenchmark<SimdBlockFilterFixed<SimpleMixSplit>>(
-          add_count, to_add, to_lookup, seed, true);
+          add_count, to_add, distinct_add, to_lookup, distinct_lookup, intersectionsize, hasduplicates, mixed_sets, seed, true);
       cout << setw(NAME_WIDTH) << names[40] << cf << endl;
   }
 #endif

Original file line number	Diff line number	Diff line change
`@@ -889,9 +889,9 @@ int main(int argc, char * argv[]) {`
`889`	`889`	`}`
`890`	`890`
`891`	`891`	`#ifdef __AVX2__`
`892`		`- if (algorithmId == 40 \|\| algorithmId < 0) {`
	`892`	`+ if (algorithmId == 40 \|\| algorithmId < 0 \|\| (algos.find(40) != algos.end())) {`
`893`	`893`	`auto cf = FilterBenchmark<SimdBlockFilterFixed<SimpleMixSplit>>(`
`894`		`- add_count, to_add, to_lookup, seed, true);`
	`894`	`+ add_count, to_add, distinct_add, to_lookup, distinct_lookup, intersectionsize, hasduplicates, mixed_sets, seed, true);`
`895`	`895`	`cout << setw(NAME_WIDTH) << names[40] << cf << endl;`
`896`	`896`	`}`
`897`	`897`	`#endif`