26 #ifndef NFD_DAEMON_TABLE_PIT_HPP 27 #define NFD_DAEMON_TABLE_PIT_HPP 47 class Pit : noncopyable
66 find(
const Interest& interest)
const 68 return const_cast<Pit*
>(
this)->findOrInsert(interest,
false).first;
76 std::pair<shared_ptr<Entry>,
bool>
79 return this->findOrInsert(interest,
true);
93 this->
erase(entry,
true);
133 std::pair<shared_ptr<Entry>,
bool>
134 findOrInsert(
const Interest& interest,
bool allowInsert);
147 #endif // NFD_DAEMON_TABLE_PIT_HPP
A common index structure for FIB, PIT, StrategyChoice, and Measurements.
shared_ptr< Entry > find(const Interest &interest) const
Finds a PIT entry for interest.
DataMatchResult findAllDataMatches(const Data &data) const
Performs a Data match.
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
void deleteInOutRecords(Entry *entry, const Face &face)
Deletes in-records and out-records for face.
std::pair< shared_ptr< Entry >, bool > insert(const Interest &interest)
Inserts a PIT entry for interest.
generalization of a network interface
const_iterator begin() const
Represents the Interest Table.
An unordered iterable of all PIT entries matching Data.
void erase(Entry *entry)
Deletes an entry.
const_iterator end() const