wt_helper.hpp File Reference

#include <algorithm>
#include <array>
#include <deque>
#include <limits>
#include <queue>
#include <utility>
#include <vector>
#include <sdsl/int_vector.hpp>

Go to the source code of this file.

Classes
struct	sdsl::pc_node
struct	sdsl::_node< t_tree_strat_fat >
struct	sdsl::_byte_tree< t_dfs_shape, t_wt >
struct	sdsl::byte_tree< t_dfs_shape >
struct	sdsl::_int_tree< t_dfs_shape, t_wt >
struct	sdsl::int_tree< t_dfs_shape >
class	sdsl::node_bv_container< t_bv >
class	sdsl::node_seq_container< t_bv >

Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.

Typedefs
typedef std::array< int_vector<>::size_type, 2 >	sdsl::range_type
typedef std::vector< range_type >	sdsl::range_vec_type

Functions
bool	sdsl::empty (const range_type &r)
	Empty range check.
int_vector ::size_type	sdsl::size (const range_type &r)
	Size of a range.
template<typename t_it , typename t_rac >
void	sdsl::calculate_character_occurences (t_it begin, t_it end, t_rac &C)
	Count for each character the number of occurrences in rac[0..size-1].
template<typename t_rac , typename sigma_type >
void	sdsl::calculate_effective_alphabet_size (const t_rac &C, sigma_type &sigma)