1 /* static_sequence_gmr_test.cpp
2 * Copyright (C) 2008, Francisco Claude, all rights reserved.
4 * static_sequence_gmr_test
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
26 #include <static_bitsequence.h>
27 #include <static_bitsequence_builder.h>
28 #include <alphabet_mapper.h>
29 #include <static_sequence.h>
31 #include <static_sequence_builder.h>
32 #include "static_sequence_tester.h"
34 int main(int argc, char ** argv) {
36 cout << "Usage: " << argv[0] << " <file> <b|r> <p|w|c> <sampling> <chunk_length> <perm_samp> <t|s>" << endl;
54 load(argv[1],&text,&n);
56 static_bitsequence_builder * bmb;
57 if(string(argv[2])==string("b"))
58 bmb = new static_bitsequence_builder_brw32(samp);
60 bmb = new static_bitsequence_builder_rrr02(samp);
62 static_sequence_builder * ssb;
64 if(string(argv[3])==string("w")) {
65 alphabet_mapper * am = new alphabet_mapper_cont(text,n,bmb);
66 ssb = new static_sequence_builder_wvtree_noptrs(bmb,am);
67 } else if(string(argv[3])==string("p")) {
68 alphabet_mapper * am = new alphabet_mapper_none();
69 wt_coder * wc = new wt_coder_huff(text,n,am);
70 ssb = new static_sequence_builder_wvtree(wc,bmb,am);
72 ssb = new static_sequence_builder_gmr_chunk(bmb, new static_permutation_builder_mrrr(perm_samp,bmb));
75 static_sequence * sseq = new static_sequence_gmr(text,n,chunk_length,bmb,ssb);
80 sseq = savetest(argv[1], sseq);
81 if(string(argv[7])==string("t"))
82 test_static_sequence(text,n,sseq);
84 cout << "Size: " << sseq->size() << endl;
85 cout << "*************************************" << endl;
86 speed_access(sseq,text,n);
87 cout << "*************************************" << endl;
88 speed_rank(sseq,text,n);
89 cout << "*************************************" << endl;
90 speed_select(sseq,text,n);