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. 
 
void erase(const Name &prefix, const bool isPrefix=true)
Deletes in-memory storage entry by prefix by default. 
 
Represents in-memory storage. 
 
virtual bool evictItem()=0
Removes one Data packet from in-memory storage based on derived class implemented replacement policy...
 
InMemoryStorageLfu(size_t limit=10)
 
void afterAccess(InMemoryStorageEntry *entry) override
Update the entry when the entry is returned by the find() function, increment the frequency according...
 
Table::const_iterator iterator
 
shared_ptr< const Data > find(const Interest &interest)
Finds the best match Data for an Interest. 
 
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. 
 
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. 
 
void beforeErase(InMemoryStorageEntry *entry) override
Update the entry or other data structures before a entry is successfully erased, erase it from the cl...