#include "name-tree-hashtable.hpp"
Include dependency graph for name-tree-iterator.hpp:
This graph shows which files directly or indirectly include this file: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::EnumerationImpl |
| enumeration operation implementation More... | |
| class | nfd::name_tree::FullEnumerationImpl |
| full enumeration implementation More... | |
| class | nfd::name_tree::Iterator |
| NameTree iterator. More... | |
| class | nfd::name_tree::PartialEnumerationImpl |
| partial enumeration implementation More... | |
| class | nfd::name_tree::PrefixMatchImpl |
| partial enumeration implementation More... | |
Namespaces | |
| nfd | |
| Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents, Colorado State University, University Pierre & Marie Curie, Sorbonne University, Washington University in St. | |
| nfd::name_tree | |
Typedefs | |
| using | nfd::name_tree::EntrySelector = std::function< bool(const Entry &)> |
| a predicate to accept or reject an Entry in find operations More... | |
| using | nfd::name_tree::EntrySubTreeSelector = std::function< std::pair< bool, bool >(const Entry &)> |
| a predicate to accept or reject an Entry and its children More... | |
| using | nfd::name_tree::Range = boost::iterator_range< Iterator > |
| a Forward Range of name tree entries More... | |
Functions | |
| std::ostream & | nfd::name_tree::operator<< (std::ostream &os, const Iterator &i) |