39 BOOST_ASSERT(m_cleanupIndex.size() <=
size());
40 CleanupEntry cleanupEntry;
41 cleanupEntry.entry = entry;
42 cleanupEntry.frequency = 0;
43 m_cleanupIndex.insert(cleanupEntry);
49 if (!m_cleanupIndex.get<byFrequency>().empty()) {
52 m_cleanupIndex.get<byFrequency>().
erase(it);
63 if (it != m_cleanupIndex.get<byEntity>().end())
64 m_cleanupIndex.get<byEntity>().erase(it);
71 m_cleanupIndex.get<byEntity>().modify(it, &incrementFrequency);
Copyright (c) 2011-2015 Regents of the University of California.
shared_ptr< const Data > find(const Interest &interest)
Finds the best match Data for an Interest.
InMemoryStorage::const_iterator begin() const
Returns begin iterator of the in-memory storage ordering by name with digest.
virtual bool evictItem()=0
Removes one Data packet from in-memory storage based on derived class implemented replacement policy...
void eraseImpl(const Name &name)
deletes in-memory storage entries by the Name with implicit digest.
Table::const_iterator iterator
virtual ~InMemoryStorageLfu()
virtual void afterAccess(InMemoryStorageEntry *entry)
Update the entry when the entry is returned by the find() function, increment the frequency according...
Represents in-memory storage.
InMemoryStorageLfu(size_t limit=10)
virtual void beforeErase(InMemoryStorageEntry *entry)
Update the entry or other data structures before a entry is successfully erased, erase it from the cl...
virtual void afterInsert(InMemoryStorageEntry *entry)
Update the entry after a entry is successfully inserted, add it to the cleanupIndex.
Represents an in-memory storage entry.
void erase(const Name &prefix, const bool isPrefix=true)
Deletes in-memory storage entry by prefix by default.