char_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
clear(void) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
compile(void) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
compiled(void) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
const_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
const_map_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
const_reverse_string_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
const_string_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
data_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
default_data(void) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
default_data(void) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
ensure_compiled(void) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_dtr(const node_type &from, CharT label) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_dtr(const node_type &from, CharT label) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_dtr_id(NodeId fromid, CharT label) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_longest(const string_type &s, size_t *matchlen=0) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_longest(const string_type &s, size_t *matchlen=0) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_mother(const node_type &to) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_mother(const node_type &to) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
find_mother_id(NodeId toid) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
first_dtr(const node_type &from) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
first_dtr(const node_type &from) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
map_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
map_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
maxlen(void) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
maxlen(void) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_depth(const node_type &node) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_depth(NodeId nodeid) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_rstring(const node_type &node) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_rstring(NodeId nodeid) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_string(const node_type &node) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_string(NodeId nodeid) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
node_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
NodeId typedef | moot::TrieVectorBase | |
NoMaxLen | moot::TrieVectorBase | [static] |
NoNode | moot::TrieVectorBase | [static] |
reverse_string_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
rfind_longest(const string_type &s, size_t *matchlen=0) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
rfind_longest(const string_type &s, size_t *matchlen=0) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
string_iterator typedef | moot::TrieVector< DataT, CharT, UCharT > | |
string_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
trie_canonicalize(string_type &s) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_default_data | moot::TrieVector< DataT, CharT, UCharT > | |
trie_insert(const string_type &s, size_t max_len) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_insert(const string_type &s) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_key(const string_type &s, const size_t max_len, string_type &dst) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_key(const string_type &s, const size_t max_len) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_key(const string_type &s) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_maxlen | moot::TrieVectorBase | |
trie_pending | moot::TrieVector< DataT, CharT, UCharT > | |
trie_rinsert(const string_type &s, size_t max_len) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_rinsert(const string_type &s) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_rkey(const string_type &s, const size_t max_len, string_type &dst) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_rkey(const string_type &s, size_t max_len) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_rkey(const string_type &s) const | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
trie_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
trie_use_case | moot::TrieVectorBase | |
TrieVector(size_t max_len=NoMaxLen, bool use_case=false) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |
TrieVectorBase(size_t maxlen=NoMaxLen, bool use_case=false) | moot::TrieVectorBase | [inline] |
uchar_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
vector_type typedef | moot::TrieVector< DataT, CharT, UCharT > | |
~TrieVector(void) | moot::TrieVector< DataT, CharT, UCharT > | [inline] |