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);
Generalization of a network interface.
A common index structure for FIB, PIT, StrategyChoice, and Measurements.
Represents an entry in the Interest table (PIT).
Represents the Interest Table.
std::pair< shared_ptr< Entry >, bool > insert(const Interest &interest)
Inserts a PIT entry for interest.
const_iterator begin() const
shared_ptr< Entry > find(const Interest &interest) const
Finds a PIT entry for interest.
const_iterator end() const
DataMatchResult findAllDataMatches(const Data &data) const
Performs a Data match.
void deleteInOutRecords(Entry *entry, const Face &face)
Deletes in-records and out-records for face.
void erase(Entry *entry)
Deletes an entry.
std::vector< shared_ptr< Entry > > DataMatchResult