tudocomp
– The TU Dortmund Compression Framework
|
#include <SuffixTree.hpp>
Public Member Functions | |
root_childrank_support (const bp_support &bp) | |
size_type | rank (size_type i) const |
Returns how many preceding silbings node has. More... | |
char | head (const SuffixTree &st, const cst_t::node_type &node) const |
Returns the first character of the string on the path from the root to the node. More... | |
cst_t::size_type | str_depth (const SuffixTree &ST, const cst_t::node_type &node) const |
Definition at line 120 of file compressors/lz78u/SuffixTree.hpp.
|
inline |
Definition at line 136 of file compressors/lz78u/SuffixTree.hpp.
|
inline |
Returns the first character of the string on the path from the root to the node.
Definition at line 164 of file compressors/lz78u/SuffixTree.hpp.
|
inline |
Returns how many preceding silbings node has.
node must be a direct child of the root. Child rank of node i (which MUST be a child of the root)
Definition at line 154 of file compressors/lz78u/SuffixTree.hpp.
|
inline |
Definition at line 176 of file compressors/lz78u/SuffixTree.hpp.