1 /* static_sequence_gmr_chunk.h
2 * Copyright (C) 2008, Francisco Claude, all rights reserved.
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
22 #ifndef _STATIC_SEQUENCE_GMR_CHUNK_H
23 #define _STATIC_SEQUENCE_GMR_CHUNK_H
26 #include <static_sequence.h>
27 #include <static_bitsequence.h>
28 #include <static_bitsequence_builder.h>
29 #include <static_permutation.h>
30 #include <static_permutation_builder.h>
34 //using namespace std;
36 /** Implementation of the Chunk of Golynski et al's rank/select
39 * [1] A. Golynski and I. Munro and S. Rao.
40 * Rank/select operations on large alphabets: a tool for text indexing.
43 * @author Francisco Claude
45 class static_sequence_gmr_chunk: public static_sequence {
47 /** Builds the structures needed for the chunk */
48 static_sequence_gmr_chunk(uint * sequence, uint chunk_length, static_bitsequence_builder *bmb, static_permutation_builder *pmb);
50 /** Destroy the chunk */
51 ~static_sequence_gmr_chunk();
53 virtual uint access(uint j);
54 virtual uint select(uint i, uint j);
55 virtual uint rank(uint i, uint j);
57 virtual uint save(FILE *fp);
58 static static_sequence_gmr_chunk * load(FILE *fp);
62 static_bitsequence * X;
64 static_permutation * permutation;
65 /** Size of the alphabet */
67 /** Length of the chunk */
69 static_sequence_gmr_chunk();