2 * Copyright (C) 2008, Francisco Claude, all rights reserved.
4 * static_sequence definition
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_H
23 #define _STATIC_SEQUENCE_H
31 #define GMR_CHUNK_HDR 3
33 #define WVTREE_NOPTRS_HDR 5
38 /** Base class for static sequences, contains many abstract functions, so this can't
41 * @author Francisco Claude
43 class static_sequence {
47 virtual ~static_sequence();
49 /** Returns the number of occurrences of c until position i */
50 virtual uint rank(uint c, uint i)=0;
51 virtual uint rankLessThan(uint &i, uint j)
53 //assert(0); // Implemented only in static_sequence_wvtree
57 /** Returns the position of the i-th c
58 * @return (uint)-1 if i=0, len if i exceeds the number of cs */
59 virtual uint select(uint c, uint i)=0;
61 /** Returns the i-th element */
62 virtual uint access(uint i)=0;
63 virtual uint access(uint i, uint &rank)
65 //assert(0); // Implemented only in static_sequence_wvtree
69 // Returns all elements from interval [i, j] such that
70 // their value is in [min, max].
71 virtual vector<int> access(uint i, uint j, uint min, uint max)
73 //assert(0); // Implemented only in static_sequence_wvtree
77 // Returns all elements from interval [i, j]
78 virtual vector<int> accessAll(uint i, uint j)
80 //assert(0); // Implemented only in static_sequence_wvtree
84 // Counts the number of elements in interval [i,j] such that
85 // their values are in [min,max]
86 virtual uint count(uint i, uint j, uint min, uint max)
88 //assert(0); // Implemented only in static_sequence_wvtree
92 /** Returns the length of the sequence */
93 virtual uint length();
95 /** Returns how many cs are in the sequence */
96 virtual uint count(uint c);
98 /** Returns the size of the structure in bytes */
99 virtual uint size()=0;
101 /** Stores the bitmap given a file pointer, return 0 in case of success */
102 virtual uint save(FILE * fp)=0;
104 virtual bool test(uint * seq, uint n);
106 /** Reads a bitmap determining the type */
107 static static_sequence * load(FILE * fp);
110 /** Length of the bitstring */
115 #include <static_sequence_wvtree.h>
116 #include <static_sequence_gmr_chunk.h>
117 #include <static_sequence_wvtree_noptrs.h>
118 #include <static_sequence_gmr.h>
119 #include <static_sequence_bs.h>
121 #endif /* _STATIC_SEQUENCE_H */