26 #ifndef NFD_DAEMON_TABLE_NAME_TREE_ITERATOR_HPP 27 #define NFD_DAEMON_TABLE_NAME_TREE_ITERATOR_HPP 82 BOOST_ASSERT(m_impl !=
nullptr);
89 BOOST_ASSERT(m_impl !=
nullptr);
111 shared_ptr<EnumerationImpl> m_impl;
115 const Entry* m_entry;
206 using Range = boost::iterator_range<Iterator>;
211 #endif // NFD_DAEMON_TABLE_NAME_TREE_ITERATOR_HPP
an EntrySelector that accepts every Entry
a common index structure for FIB, PIT, StrategyChoice, and Measurements
bool operator==(const Route &lhs, const Route &rhs)
bool operator!=(const Iterator &other) const
std::ostream & operator<<(std::ostream &os, const Iterator &i)
const Entry * operator->() const
Table::const_iterator iterator
enumeration operation implementation
std::pair< bool, bool > operator()(const Entry &) const
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
partial enumeration implementation
an EntrySubTreeSelector that accepts every Entry and its children
an entry in the name tree
bool operator()(const Entry &) const
partial enumeration implementation
boost::iterator_range< Iterator > Range
a Forward Range of name tree entries
std::function< std::pair< bool, bool >(const Entry &)> EntrySubTreeSelector
a predicate to accept or reject an Entry and its children
const Entry & operator*() const
full enumeration implementation
std::function< bool(const Entry &)> EntrySelector
a predicate to accept or reject an Entry in find operations
a hashtable for fast exact name lookup