40 BOOST_ASSERT(m_cleanupIndex.size() <=
size());
41 m_cleanupIndex.insert(entry);
47 if (!m_cleanupIndex.get<byArrival>().empty()) {
48 CleanupIndex::index<byArrival>::type::iterator it = m_cleanupIndex.get<byArrival>().
begin();
50 m_cleanupIndex.get<byArrival>().
erase(it);
60 CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().
find(entry);
61 if (it != m_cleanupIndex.get<byEntity>().end())
62 m_cleanupIndex.get<byEntity>().erase(it);
Copyright (c) 2013-2016 Regents of the University of California.
shared_ptr< const Data > find(const Interest &interest)
Finds the best match Data for an Interest.
InMemoryStorageFifo(size_t limit=10)
InMemoryStorage::const_iterator begin() const
Returns begin iterator of the in-memory storage ordering by name with digest.
void eraseImpl(const Name &name)
deletes in-memory storage entries by the Name with implicit digest.
Represents in-memory storage.
void afterInsert(InMemoryStorageEntry *entry) override
Update the entry after a entry is successfully inserted, add it to the cleanupIndex.
Represents an in-memory storage entry.
void beforeErase(InMemoryStorageEntry *entry) override
Update the entry or other data structures before a entry is successfully erased, erase it from the cl...
bool evictItem() override
Removes one Data packet from in-memory storage based on FIFO.
void erase(const Name &prefix, const bool isPrefix=true)
Deletes in-memory storage entry by prefix by default.