-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy patheval_sets.cc
More file actions
136 lines (115 loc) · 3.88 KB
/
eval_sets.cc
File metadata and controls
136 lines (115 loc) · 3.88 KB
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
#include "prime_set.h"
#include "hashset.h"
#include "treeset.h"
#include "array_set.h"
#include "bitset.h"
#include "utils.h"
#include "benchmark.h"
#include <iostream>
#include <cstdlib>
using namespace std;
void DoSize(std::string title, const SetDataSuite& set_data) {
cout << title;
cout.flush();
vector<PrimeSet*> sets;
for (int i = 0; i < set_data.num_sets(); ++i) {
sets.push_back(new PrimeSet(set_data.GetSetData(i)));
}
size_t avg_size = 0;
for (auto s : sets) {
avg_size += s->num_bits();
}
cout << " " << avg_size / sets.size() << endl;
}
int main(int argc, char* argv[]) {
if (argc != 8 && argc != 9 && argc != 10) {
cout << "Usage: " << argv[0] << " primes-file "
<< "num-sets set-size primes-range contains-true-ratio "
<< "includes-true-ratio equals-true-ratio [latex-output]"
<< " [test-size] "
<< endl;
return 0;
}
string filename = argv[1];
int num_sets = atoi(argv[2]);
int set_size = atoi(argv[3]);
int primes_range = atoi(argv[4]);
int contains_true_ratio = atoi(argv[5]);
int includes_true_ratio = atoi(argv[6]);
int equals_true_ratio = atoi(argv[7]);
bool latex_output = true;
if (argc == 9)
latex_output = (atoi(argv[8]) != 0);
bool do_size = false;
if (argc == 10)
do_size = true;
if (latex_output && !do_size)
cout << "\\multirow{4}{*}{" << double(set_size)/(double)primes_range
<< "} ";
Primes primes(10000000, filename);
SetDataSuite data_suite(num_sets, set_size, primes_range, primes);
if (!latex_output && !do_size) {
cout << "Generating all set data ... "; cout.flush();
}
data_suite.CreateAllSetData();
if (do_size) {
cout << primes_range << " " << double(set_size)/(double)primes_range;
cout.flush();
DoSize(" ", data_suite);
return 0;
}
if (!latex_output)
cout << "Done\n" << endl;
DoBenchmark<PrimeSet>("godel hash", data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
/* if (!latex_output)
cout << endl;
DoBenchmark<TreeSet>("sorted treeset", data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
if (!latex_output)
cout << endl;
DoBenchmark<ArraySet>("sorted arrayset", data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
if (!latex_output)
cout << endl;
DoBenchmark<HashSet>("hashset", data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);*/
if (!latex_output)
cout << endl;
switch (primes_range) {
case 100:
DoBenchmark<BitSet<542> >("bitset",
data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
break;
case 1000:
DoBenchmark<BitSet<7920> >("bitset",
data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
break;
case 10000:
DoBenchmark<BitSet<104730> >("bitset",
data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
break;
case 100000:
DoBenchmark<BitSet<1299710> >("bitset",
data_suite, contains_true_ratio,
includes_true_ratio, equals_true_ratio,
latex_output);
break;
default:
cout << "Invalide range!" << endl;
break;
}
if (latex_output)
cout << "\\hline" << endl;
return 0;
}