Main Page   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members  

moot::SuffixTrie Member List

This is the complete list of members for moot::SuffixTrie, including all inherited members.
_build_assoc(const mootLexfreqs &lf, const TagIDTable &tagids)moot::SuffixTrie
_build_compute_mles(const mootLexfreqs &lf, const mootNgrams &ng, const TagIDTable &tagids, TagID eos_tagid)moot::SuffixTrie
_build_compute_theta(const mootLexfreqs &lf, const mootNgrams &ng, const TagIDTable &tagids, TagID eos_tagid)moot::SuffixTrie
_build_insert(const mootLexfreqs &lf)moot::SuffixTrie
_build_invert_mles(const mootNgrams &ng, const TagIDTable &tagids, TagID eos_tagid)moot::SuffixTrie
build(const mootLexfreqs &lf, const mootNgrams &ng, const TagIDTable &tagids, TagID eos_tagid, bool verbose=false)moot::SuffixTrie
char_type typedefmoot::TrieVector< SuffixTrieDataT >
clear(void)moot::TrieVector< SuffixTrieDataT > [inline]
compile(void)moot::TrieVector< SuffixTrieDataT > [inline]
compiled(void) constmoot::TrieVector< SuffixTrieDataT > [inline]
const_find_ancestor_nonempty(const_iterator dtr, size_t *matchlen=0) constmoot::SuffixTrie [inline]
const_iterator typedefmoot::TrieVector< SuffixTrieDataT >
const_map_iterator typedefmoot::TrieVector< SuffixTrieDataT >
const_reverse_string_iterator typedefmoot::TrieVector< SuffixTrieDataT >
const_string_iterator typedefmoot::TrieVector< SuffixTrieDataT >
data_type typedefmoot::TrieVector< SuffixTrieDataT >
default_data(void) constmoot::TrieVector< SuffixTrieDataT > [inline]
default_data(void)moot::TrieVector< SuffixTrieDataT > [inline]
ensure_compiled(void)moot::TrieVector< SuffixTrieDataT > [inline]
find_ancestor_nonempty(iterator dtr, size_t *matchlen=0)moot::SuffixTrie [inline]
find_dtr(const node_type &from, char label)moot::TrieVector< SuffixTrieDataT > [inline]
find_dtr(const node_type &from, char label) constmoot::TrieVector< SuffixTrieDataT > [inline]
find_dtr_id(NodeId fromid, char label) constmoot::TrieVector< SuffixTrieDataT > [inline]
find_longest(const string_type &s, size_t *matchlen=0)moot::TrieVector< SuffixTrieDataT > [inline]
find_longest(const string_type &s, size_t *matchlen=0) constmoot::TrieVector< SuffixTrieDataT > [inline]
find_mother(const node_type &to)moot::TrieVector< SuffixTrieDataT > [inline]
find_mother(const node_type &to) constmoot::TrieVector< SuffixTrieDataT > [inline]
find_mother_id(NodeId toid) constmoot::TrieVector< SuffixTrieDataT > [inline]
first_dtr(const node_type &from)moot::TrieVector< SuffixTrieDataT > [inline]
first_dtr(const node_type &from) constmoot::TrieVector< SuffixTrieDataT > [inline]
iterator typedefmoot::TrieVector< SuffixTrieDataT >
map_iterator typedefmoot::TrieVector< SuffixTrieDataT >
map_type typedefmoot::TrieVector< SuffixTrieDataT >
maxcountmoot::SuffixTrie
maxlen(void) constmoot::TrieVector< SuffixTrieDataT > [inline]
maxlen(void)moot::TrieVector< SuffixTrieDataT > [inline]
node_depth(const node_type &node) constmoot::TrieVector< SuffixTrieDataT > [inline]
node_depth(NodeId nodeid) constmoot::TrieVector< SuffixTrieDataT > [inline]
node_rstring(const node_type &node) constmoot::TrieVector< SuffixTrieDataT > [inline]
node_rstring(NodeId nodeid) constmoot::TrieVector< SuffixTrieDataT > [inline]
node_string(const node_type &node) constmoot::TrieVector< SuffixTrieDataT > [inline]
node_string(NodeId nodeid) constmoot::TrieVector< SuffixTrieDataT > [inline]
node_type typedefmoot::TrieVector< SuffixTrieDataT >
NodeId typedefmoot::TrieVectorBase
NoMaxLenmoot::TrieVectorBase [static]
NoNodemoot::TrieVectorBase [static]
reverse_string_iterator typedefmoot::TrieVector< SuffixTrieDataT >
rfind_longest(const string_type &s, size_t *matchlen=0)moot::TrieVector< SuffixTrieDataT > [inline]
rfind_longest(const string_type &s, size_t *matchlen=0) constmoot::TrieVector< SuffixTrieDataT > [inline]
rfind_longest_nonempty(const mootTokString &tokstr, size_t *matchlen=0)moot::SuffixTrie [inline]
rfind_longest_nonempty(const mootTokString &tokstr, size_t *matchlen=0) constmoot::SuffixTrie [inline]
string_iterator typedefmoot::TrieVector< SuffixTrieDataT >
string_type typedefmoot::TrieVector< SuffixTrieDataT >
SuffixTrie(size_t max_length=SuffixTrieDefaultMaxLen, bool use_case=true, size_t max_count=10)moot::SuffixTrie [inline]
SuffixTrieDefaultMaxLenmoot::SuffixTrie [static]
sufprobs(const mootTokString &tokstr, size_t *matchlen=0) constmoot::SuffixTrie [inline]
TagID typedefmoot::SuffixTrie
TagIDTable typedefmoot::SuffixTrie
thetamoot::SuffixTrie
trie_canonicalize(string_type &s) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_default_datamoot::TrieVector< SuffixTrieDataT >
trie_insert(const string_type &s, size_t max_len)moot::TrieVector< SuffixTrieDataT > [inline]
trie_insert(const string_type &s)moot::TrieVector< SuffixTrieDataT > [inline]
trie_key(const string_type &s, const size_t max_len, string_type &dst) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_key(const string_type &s, const size_t max_len) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_key(const string_type &s) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_maxlenmoot::TrieVectorBase
trie_pendingmoot::TrieVector< SuffixTrieDataT >
trie_rinsert(const string_type &s, size_t max_len)moot::TrieVector< SuffixTrieDataT > [inline]
trie_rinsert(const string_type &s)moot::TrieVector< SuffixTrieDataT > [inline]
trie_rkey(const string_type &s, const size_t max_len, string_type &dst) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_rkey(const string_type &s, size_t max_len) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_rkey(const string_type &s) constmoot::TrieVector< SuffixTrieDataT > [inline]
trie_type typedefmoot::TrieVector< SuffixTrieDataT >
trie_use_casemoot::TrieVectorBase
TrieType typedefmoot::SuffixTrie
TrieVector(size_t max_len=NoMaxLen, bool use_case=false)moot::TrieVector< SuffixTrieDataT > [inline]
TrieVectorBase(size_t maxlen=NoMaxLen, bool use_case=false)moot::TrieVectorBase [inline]
txtdump(FILE *out, const TagIDTable &tagids) constmoot::SuffixTrie
uchar_type typedefmoot::TrieVector< SuffixTrieDataT >
vector_type typedefmoot::TrieVector< SuffixTrieDataT >
~SuffixTrie(void)moot::SuffixTrie [inline]
~TrieVector(void)moot::TrieVector< SuffixTrieDataT > [inline]

Generated on Mon Sep 11 16:10:36 2006 for libmoot by doxygen1.2.18