1 /* static_bitsequence_tester.cpp
2 * Copyright (C) 2008, Francisco Claude, all rights reserved.
4 * static_bitsequence_tester
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
25 #include <static_bitsequence.h>
30 double ticks= (double)sysconf(_SC_CLK_TCK);
40 return (t2.tms_utime-t1.tms_utime)/ticks;
42 /* end Time meassuring */
44 uint NQUERIES=10000000;
47 void load(char *fname, uint ** text, uint * n) {
48 FILE * fp = fopen(fname,"r");
50 cout << "could not open " << fname << endl;
53 if(fread(n,sizeof(uint),1,fp)!=1) {
54 cout << "Error reading file " << fname << endl;
57 *text = new uint[uint_len(*n,1)];
59 if(fread(*text,sizeof(uint),uint_len(*n,1),fp)!=uint_len(*n,1)) {
60 cout << "Error reading file " << fname << endl;
65 void test_bitsequence(uint * bitseq, uint len, static_bitsequence * bs) {
68 for(uint i=0;i<len && !error;i++) {
69 //cout << "i="<<i<< endl;
71 if(i%max(1,(bs->length()/100))==0) { cout << "."; cout.flush(); }
72 if(i%max(1,(bs->length()/10))==0) { cout << endl; cout.flush(); }
74 if(bitget(bitseq,i)) ones++;
75 if(bs->access(i) != (bitget(bitseq,i)!=0)) {
76 cout << "Access error for position " << i << endl;
77 cout << " got: " << bs->access(i) << " expected: " << (bitget(bitseq,i)!=0) << endl;
80 if(bs->rank1(i) != ones) {
81 cout << "Rank1 error for position " << i << endl;
82 cout << " got: " << bs->rank1(i) << " expected: " << ones << endl;
85 if(bitget(bitseq,i) && bs->select1(ones) != i) {
86 cout << "Select1 error for position " << i << " ones:" << ones << endl;
87 cout << " got: " << bs->select1(ones) << " expected: " << i << endl;
90 if(bs->rank0(i) != i+1-ones) {
91 cout << "Rank0 error for position " << i << endl;
92 cout << " got: " << bs->rank0(i) << " expected: " << ones << endl;
95 if(!bitget(bitseq,i) && bs->select0(i+1-ones) != i) {
96 cout << "Select0 error for position " << i << endl;
97 cout << " got: " << bs->select0(i+1-ones) << " expected: " << i << endl;
104 void speed_access(static_bitsequence * ss, uint * bitseq, uint n) {
109 for(uint i=0;i<NQUERIES;i++) {
111 acc += ss->access(pos);
113 double t = stop_clock();
114 cout << " * Time for " << NQUERIES << " accesses: " << t << " secs" << endl;
115 cout << " * Time per access: " << 1000*t/NQUERIES << " msecs" << endl;
116 cout << " - Check sum: " << acc << endl;
119 void speed_rank0(static_bitsequence * ss, uint * bitseq, uint n) {
124 for(uint i=0;i<NQUERIES;i++) {
126 acc += ss->rank0(pos);
128 double t = stop_clock();
129 cout << " * Time for " << NQUERIES << " rank0s: " << t << " secs" << endl;
130 cout << " * Time per rank0: " << 1000*t/NQUERIES << " msecs" << endl;
131 cout << " - Check sum: " << acc << endl;
134 void speed_rank1(static_bitsequence * ss, uint * bitseq, uint n) {
139 for(uint i=0;i<NQUERIES;i++) {
141 acc += ss->rank1(pos);
143 double t = stop_clock();
144 cout << " * Time for " << NQUERIES << " rank1s: " << t << " secs" << endl;
145 cout << " * Time per rank1: " << 1000*t/NQUERIES << " msecs" << endl;
146 cout << " - Check sum: " << acc << endl;
149 void speed_select0(static_bitsequence * ss, uint * bitseq, uint n) {
151 uint ones=ss->rank0(n-1);
155 for(uint i=0;i<NQUERIES;i++) {
156 uint pos = rand()%ones+1;
157 acc += ss->select0(pos);
159 double t = stop_clock();
160 cout << " * Time for " << NQUERIES << " select0s: " << t << " secs" << endl;
161 cout << " * Time per select0: " << 1000*t/NQUERIES << " msecs" << endl;
162 cout << " - Check sum: " << acc << endl;
165 void speed_select1(static_bitsequence * ss, uint * bitseq, uint n) {
167 uint ones=ss->rank1(n-1);
171 for(uint i=0;i<NQUERIES;i++) {
172 uint pos = rand()%ones+1;
173 acc += ss->select1(pos);
175 double t = stop_clock();
176 cout << " * Time for " << NQUERIES << " select1s: " << t << " secs" << endl;
177 cout << " * Time per select1: " << 1000*t/NQUERIES << " msecs" << endl;
178 cout << " - Check sum: " << acc << endl;