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
|
// Copyright (c) 2017, Nicola Prezza. All rights reserved.
// Use of this source code is governed
// by a MIT license that can be found in the LICENSE file.
/*
* benchmark.cpp
*
* Created on: Oct 15, 2015
* Author: nico
*/
#include "dynamic/internal/spsi.hpp"
#include "dynamic/internal/spsi_check.hpp"
#include <chrono>
#include "dynamic/dynamic.hpp"
#include "dynamic/internal/alphabet_encoder.hpp"
#include "dynamic/algorithms/rle_lz77_v1.hpp"
#include "dynamic/algorithms/rle_lz77_v2.hpp"
#include "dynamic/internal/packed_vector.hpp"
#include "dynamic/internal/wt_string.hpp"
using namespace std;
using namespace dyn;
void help(){
cout << "Benchmark some dynamic data structures of the library." << endl << endl;
cout << "Usage: benchmark <-g|-s> <size> <P>" << endl;
cout << " -g benchmark gap bitvector" << endl;
cout << " -s benchmark succinct bitvector" << endl;
cout << " <size> number of bits in the bitvector" << endl;
cout << " <P> probability of a bit set in [0,1]" << endl << endl;
cout << "Example: benchmark -g 1000000 0.01" << endl;
exit(0);
}
template<class dyn_bv_t>
void benchmark_bv(uint64_t size, double p = 0.5){
dyn_bv_t bv;
srand(time(NULL));
using std::chrono::high_resolution_clock;
using std::chrono::duration_cast;
using std::chrono::duration;
auto t1 = high_resolution_clock::now();
cout << "insert ... " << flush;
for(uint64_t i=0;i<size;++i){
ulint c = double(rand())/RAND_MAX < p ? 1 : 0;
bv.insert(rand()%(bv.size()+1),c);
}
cout << "done." << endl;
auto t2 = high_resolution_clock::now();
auto max_size = bv.bit_size();
cout << "access ... " << flush;
for(uint64_t i=0;i<size;++i){
//bv[rand()%bv.size()];
bv.at(rand()%bv.size());
}
cout << "done." << endl;
auto t3 = high_resolution_clock::now();
cout << "rank 0 ... " << flush;
for(uint64_t i=0;i<size;++i){
bv.rank(rand()%(bv.size()+1),0);
}
cout << "done." << endl;
auto t4 = high_resolution_clock::now();
cout << "rank 1 ... " << flush;
for(uint64_t i=0;i<size;++i){
bv.rank(rand()%(bv.size()+1),1);
}
cout << "done." << endl;
auto t5 = high_resolution_clock::now();
uint64_t nr_0 = bv.rank(bv.size(),0);
uint64_t nr_1 = bv.rank(bv.size(),1);
cout << "select 0 ... " << flush;
for(uint64_t i=0;i<size;++i){
bv.select(rand()%nr_0,0);
}
cout << "done." << endl;
auto t6 = high_resolution_clock::now();
cout << "select 1 ... " << flush;
for(uint64_t i=0;i<size;++i){
bv.select(rand()%nr_1,1);
}
cout << "done." << endl;
auto t7 = high_resolution_clock::now();
cout << "remove ... " << flush;
for(uint64_t i=0;i<size;++i){
//bv[rand()%bv.size()];
bv.remove(rand()%bv.size());
//rand()%bv.size();
}
cout << "done." << endl;
auto t8 = high_resolution_clock::now();
uint64_t sec_insert = std::chrono::duration_cast<std::chrono::microseconds>(t2 - t1).count();
uint64_t sec_access = std::chrono::duration_cast<std::chrono::microseconds>(t3 - t2).count();
uint64_t sec_rank0 = std::chrono::duration_cast<std::chrono::microseconds>(t4 - t3).count();
uint64_t sec_rank1 = std::chrono::duration_cast<std::chrono::microseconds>(t5 - t4).count();
uint64_t sec_sel0 = std::chrono::duration_cast<std::chrono::microseconds>(t6 - t5).count();
uint64_t sec_sel1 = std::chrono::duration_cast<std::chrono::microseconds>(t7 - t6).count();
uint64_t sec_rem = std::chrono::duration_cast<std::chrono::microseconds>(t8 - t7).count();
cout << (double)sec_insert/size << " microseconds/insert" << endl;
cout << (double)sec_access/size << " microseconds/access" << endl;
cout << (double)sec_rank0/size << " microseconds/rank0" << endl;
cout << (double)sec_rank1/size << " microseconds/rank1" << endl;
cout << (double)sec_sel0/size << " microseconds/select0" << endl;
cout << (double)sec_sel1/size << " microseconds/select1" << endl;
cout << (double)sec_rem/size << " microseconds/remove" << endl;
cout << "Max bit size of the structure (allocated memory, bits): " << max_size << endl;
cout << "Final bit size of the structure (allocated memory, bits): " << bv.bit_size() << endl;
}
int main(int argc,char** argv) {
if(argc!=4) help();
ulint n = atoi(argv[2]);
double P = atof(argv[3]);
cout << "size = " << n << ". P = " << P << endl;
if(string(argv[1]).compare("-g")==0){
cout << "Benchmarking gap bitvector" << endl;
benchmark_bv<gap_bv>(n,P);
}else if(string(argv[1]).compare("-s")==0){
cout << "Benchmarking succinct bitvector" << endl;
benchmark_bv<suc_bv>(n,P);
}else help();
}
|
