a hashtable node More...
#include <name-tree-hashtable.hpp>
Public Member Functions | |
Node (HashValue h, const Name &name) | |
~Node () | |
Public Attributes | |
const HashValue | hash |
Node * | prev |
Node * | next |
Entry | entry |
a hashtable node
Zero or more nodes can be added to a hashtable bucket. They are organized as a doubly linked list through prev and next pointers.
Definition at line 61 of file name-tree-hashtable.hpp.
Definition at line 92 of file name-tree-hashtable.cpp.
nfd::name_tree::Node::~Node | ( | ) |
Definition at line 100 of file name-tree-hashtable.cpp.
const HashValue nfd::name_tree::Node::hash |
Definition at line 75 of file name-tree-hashtable.hpp.
Referenced by nfd::name_tree::FullEnumerationImpl::advance(), nfd::name_tree::Hashtable::erase(), and nfd::name_tree::Hashtable::~Hashtable().
Node* nfd::name_tree::Node::prev |
Definition at line 76 of file name-tree-hashtable.hpp.
Referenced by nfd::name_tree::Hashtable::~Hashtable(), and ~Node().
Node* nfd::name_tree::Node::next |
Definition at line 77 of file name-tree-hashtable.hpp.
Referenced by nfd::name_tree::FullEnumerationImpl::advance(), nfd::name_tree::foreachNode(), nfd::name_tree::Hashtable::~Hashtable(), and ~Node().
|
mutable |
Definition at line 78 of file name-tree-hashtable.hpp.
Referenced by nfd::name_tree::FullEnumerationImpl::advance(), nfd::name_tree::Hashtable::erase(), nfd::name_tree::NameTree::findExactMatch(), nfd::name_tree::NameTree::findLongestPrefixMatch(), nfd::name_tree::NameTree::lookup(), and nfd::name_tree::Hashtable::~Hashtable().