|
|
typedef K | key_type |
| |
|
typedef T | mapped_type |
| |
|
typedef std::pair< const K, T > | value_type |
| |
|
typedef radix_tree_it< K, T > | iterator |
| |
|
typedef std::size_t | size_type |
| |
|
|
size_type | size () const |
| |
|
bool | empty () const |
| |
|
void | clear () |
| |
|
iterator | find (const K &key) |
| |
|
iterator | begin () |
| |
|
iterator | end () |
| |
|
std::pair< iterator, bool > | insert (const value_type &val) |
| |
|
bool | erase (const K &key) |
| |
|
void | erase (iterator it) |
| |
|
void | prefix_match (const K &key, std::vector< iterator > &vec) |
| |
|
void | greedy_match (const K &key, std::vector< iterator > &vec) |
| |
|
iterator | longest_match (const K &key) |
| |
|
bool | contains (const K &key) |
| |
|
T & | operator[] (const K &lhs) |
| |
|
T & | at (const K &lhs) throw (ContainerException) |
| |
template<typename K, typename T>
class sella::container::radix_tree< K, T >
Definition at line 50 of file radix_tree.h.
The documentation for this class was generated from the following file:
- /home/sella/digitalgenesis/libutil++/releases/rpm/BUILD/libutil++-1.9.3/src/sella/container/radix_tree.h
1.8.5
