Inheritance diagram for claw::trie< T, Comp >::trie_node:
Definition at line 73 of file trie.hpp.
Public Member Functions | |
trie_node (const T &val, unsigned int c=0) | |
Trie node constructor. | |
trie_node (const trie_node &that) | |
Trie node copy constructor. | |
Public Attributes | |
T | value |
Value of the node. | |
unsigned int | count |
Times we found the word from the root to this node. Zero if never seen. |
claw::trie< T, Comp >::trie_node::trie_node | ( | const T & | val, | |
unsigned int | c = 0 | |||
) |
Trie node constructor.
val | Value of the node. | |
c | Count for the node. |
Definition at line 44 of file trie.tpp.
00046 : claw::binary_node< typename claw::trie<T, Comp>::trie_node >(), value(val), 00047 count(0) 00048 { 00049 00050 } // trie_node() [constructor]
claw::trie< T, Comp >::trie_node::trie_node | ( | const trie_node & | that | ) |
Trie node copy constructor.
that | Node to copy from. |
Definition at line 58 of file trie.tpp.
00059 : claw::binary_node< typename claw::trie<T, Comp>::trie_node >(that), 00060 value(that.value), count(that.count) 00061 { 00062 00063 } // trie_node [copy constructor]
unsigned int claw::trie< T, Comp >::trie_node::count |
Times we found the word from the root to this node. Zero if never seen.
Definition at line 81 of file trie.hpp.
Referenced by claw::trie< T, Comp >::count(), and claw::trie< T, Comp >::insert().
T claw::trie< T, Comp >::trie_node::value |