Go to the source code of this file.
Classes | |
class | nfd::name_tree::Hashtable |
A hashtable for fast exact name lookup. More... | |
struct | nfd::name_tree::HashtableOptions |
Provides options for Hashtable. More... | |
class | nfd::name_tree::Node |
A hashtable node. More... | |
Namespaces | |
nfd | |
-status-http-server | |
nfd::name_tree | |
Typedefs | |
using | nfd::name_tree::HashSequence = std::vector< HashValue > |
A sequence of hash values. More... | |
using | nfd::name_tree::HashValue = size_t |
A single hash value. More... | |
Functions | |
HashValue | nfd::name_tree::computeHash (const Name &name, size_t prefixLen=std::numeric_limits< size_t >::max()) |
Computes hash value of name.getPrefix(prefixLen) . More... | |
HashSequence | nfd::name_tree::computeHashes (const Name &name, size_t prefixLen=std::numeric_limits< size_t >::max()) |
Computes hash values for each prefix of name.getPrefix(prefixLen) . More... | |
template<typename N , typename F > | |
void | nfd::name_tree::foreachNode (N *head, const F &func) |
Invoke a function for each node in a doubly linked list. More... | |
Node * | nfd::name_tree::getNode (const Entry &entry) |