#include <linktrie.h>
Public Member Functions | |
| ltrie () | |
| ltrie (int depth) | |
| ltrie (const string &seq) | |
| void | build (const string &seq, const Matrix &mat, float T, float F) |
| void | insert (const char word[], int index) |
| const lnode * | find (const char word[]) const |
| void | showLeafs (ostream &ous) const |
| ~ltrie () | |
Protected Attributes | |
| lnode * | root |
| int | ws |
| vector< lnode * > | leafnodes |
| ltrie::ltrie | ( | ) | [inline] |
| ltrie::ltrie | ( | int | depth | ) | [inline] |
| ltrie::~ltrie | ( | ) |
References deleteNode(), and root.
| void ltrie::build | ( | const string & | seq, | |
| const Matrix & | mat, | |||
| float | T, | |||
| float | F | |||
| ) |
| void ltrie::insert | ( | const char | word[], | |
| int | index | |||
| ) |
for efficiency, I do not check the length of the word it should be ws leng!
References lnode::child, lnode::data, lnode::key, leafnodes, intnode::next, lnode::pos, root, lnode::sibling, and ws.
| const lnode * ltrie::find | ( | const char | word[] | ) | const |
the word length must be ws length No word length-checking is performed.
return 0 if not found.
References lnode::child, lnode::data, root, lnode::sibling, and ws.
Referenced by Lale::findMatch().
| void ltrie::showLeafs | ( | ostream & | ous | ) | const |
lnode* ltrie::root [protected] |
vector<lnode*> ltrie::leafnodes [protected] |
Referenced by insert(), and showLeafs().
1.5.6