A node in a Patricia trie. More...
#include <DwmPatricia.hh>
Public Member Functions | |
| PatriciaNode () | |
| Constructor. | |
| PatriciaNode (const PatriciaNode &pn) | |
| PatriciaNode< KeyType, ValueType > & | operator= (const PatriciaNode< KeyType, ValueType > &pn) |
| PatriciaNode (const KeyType &key, const ValueType &data, int bitIdx, PatriciaNode< KeyType, ValueType > *left, PatriciaNode< KeyType, ValueType > *right) | |
| Constructor. | |
| ~PatriciaNode () | |
| Destructor. | |
| void | Initialize (const KeyType &key, const ValueType &data, int bitIdx, PatriciaNode< KeyType, ValueType > *left, PatriciaNode< KeyType, ValueType > *right) |
| Initialize this node with the given data. | |
| ValueType & | GetData () |
| Returns the data field. | |
| bool | SetData (const ValueType &data) |
| Sets the data field. | |
| KeyType | GetKey () const |
| Returns the key field. | |
| PatriciaNode< KeyType, ValueType > * | GetLeft () |
| Returns the left branch. | |
| PatriciaNode< KeyType, ValueType > * | GetRight () |
| Returns the right branch. | |
| uint32_t | StreamedLength () const |
| bool | operator== (const PatriciaNode< KeyType, ValueType > &n) const |
Friends | |
| class | Patricia< KeyType, ValueType, std::equal_to< KeyType > > |
A node in a Patricia trie.
Each node stores one key, and the data associated with that key.