This class is a trie tree. More...
#include <trie.hpp>
Public Types | |
| typedef const T | value_type |
| typedef Comp | value_equal_to |
Public Member Functions | |
| trie (const trie< T, Comp > &that) | |
| unsigned int | size () const |
| bool | empty () const |
| void | clear () |
| template<class InputIterator> | |
| void | insert (InputIterator first, InputIterator last) |
| template<class InputIterator> | |
| unsigned int | count (InputIterator first, InputIterator last) |
This class is a trie tree.
Trie trees are used for storage and count of linear datas with similar prefixes, typically words. For example, if you insert words
| typedef Comp claw::trie< T, Comp >::value_equal_to |
| typedef const T claw::trie< T, Comp >::value_type |