#include "name-tree-hashtable.hpp"

Go to the source code of this file.
Classes | |
| struct | nfd::name_tree::AnyEntry | 
| an EntrySelector that accepts every Entry  More... | |
| struct | nfd::name_tree::AnyEntrySubTree | 
| an EntrySubTreeSelector that accepts every Entry and its children  More... | |
| class | nfd::name_tree::Iterator | 
| NameTree iterator.  More... | |
| class | nfd::name_tree::EnumerationImpl | 
| enumeration operation implementation  More... | |
| class | nfd::name_tree::FullEnumerationImpl | 
| full enumeration implementation  More... | |
| class | nfd::name_tree::PartialEnumerationImpl | 
| partial enumeration implementation  More... | |
| class | nfd::name_tree::PrefixMatchImpl | 
| partial enumeration implementation  More... | |
Namespaces | |
| nfd | |
| Copyright (c) 2011-2015 Regents of the University of California.  | |
| nfd::name_tree | |
Typedefs | |
| typedef function< bool(const Entry &entry)> | nfd::name_tree::EntrySelector | 
| a predicate to accept or reject an Entry in find operations  More... | |
| typedef function< std::pair< bool, bool >const Entry &entry)> | nfd::name_tree::EntrySubTreeSelector | 
| a predicate to accept or reject an Entry and its children  More... | |
| typedef boost::iterator_range< Iterator > | nfd::name_tree::Range | 
| a Forward Range of name tree entries  More... | |
Functions | |
| std::ostream & | nfd::name_tree::operator<< (std::ostream &os, const Iterator &i) |