forked from simongog/sdsl-lite
-
Notifications
You must be signed in to change notification settings - Fork 1
/
wavelet_trees.hpp
81 lines (71 loc) · 2.48 KB
/
wavelet_trees.hpp
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
/* sdsl - succinct data structures library
Copyright (C) 2011 Simon Gog
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/ .
*/
/*! \file wavelet_trees.hpp
\brief wavelet_trees.hpp contains wavelet tree implementations.
\author Simon Gog
*/
#ifndef INCLUDED_SDSL_WAVELET_TREES
#define INCLUDED_SDSL_WAVELET_TREES
/** \defgroup wt Wavelet Trees (WT)
* This group contains data structures for wavelet trees. The following methods are supported:
* - []-operator
* - rank(i, c)
* - select(i, c)
* - inverse_select(i)
*/
#include "wt_pc.hpp"
#include "wt_blcd.hpp"
#include "wt_gmr.hpp"
#include "wt_huff.hpp"
#include "wt_hutu.hpp"
#include "wt_int.hpp"
#include "wm_int.hpp"
#include "wt_rlmn.hpp"
#include "wt_ap.hpp"
#include "wt_algorithm.hpp"
namespace sdsl
{
template<class t_bitvector = bit_vector,
class t_rank = typename t_bitvector::rank_1_type,
class t_select = typename t_bitvector::select_1_type,
class t_select_zero = typename t_bitvector::select_0_type
>
using wt_hutu_int = wt_pc<hutu_shape,
t_bitvector,
t_rank,
t_select,
t_select_zero,
int_tree<>>;
template<class t_bitvector = bit_vector,
class t_rank = typename t_bitvector::rank_1_type,
class t_select = typename t_bitvector::select_1_type,
class t_select_zero = typename t_bitvector::select_0_type>
using wt_huff_int = wt_pc<huff_shape,
t_bitvector,
t_rank,
t_select,
t_select_zero,
int_tree<>>;
template<class t_bitvector = bit_vector,
class t_rank = typename t_bitvector::rank_1_type,
class t_select_one = typename t_bitvector::select_1_type,
class t_select_zero = typename t_bitvector::select_0_type>
using wt_blcd_int = wt_pc<balanced_shape,
t_bitvector,
t_rank,
t_select_one,
t_select_zero,
int_tree<>>;
}
#endif