NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.0: NDN, CCN, CCNx, content centric networks
API Documentation
in-memory-storage-lfu.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
23 
24 namespace ndn {
25 namespace util {
26 
28  : InMemoryStorage(limit)
29 {
30 }
31 
33 {
34 }
35 
36 void
38 {
39  BOOST_ASSERT(m_cleanupIndex.size() <= size());
40  CleanupEntry cleanupEntry;
41  cleanupEntry.entry = entry;
42  cleanupEntry.frequency = 0;
43  m_cleanupIndex.insert(cleanupEntry);
44 }
45 
46 bool
48 {
49  if (!m_cleanupIndex.get<byFrequency>().empty()) {
50  CleanupIndex::index<byFrequency>::type::iterator it = m_cleanupIndex.get<byFrequency>().begin();
51  eraseImpl(((*it).entry)->getFullName());
52  m_cleanupIndex.get<byFrequency>().erase(it);
53  return true;
54  }
55 
56  return false;
57 }
58 
59 void
61 {
62  CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
63  if (it != m_cleanupIndex.get<byEntity>().end())
64  m_cleanupIndex.get<byEntity>().erase(it);
65 }
66 
67 void
69 {
70  CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
71  m_cleanupIndex.get<byEntity>().modify(it, &incrementFrequency);
72 }
73 
74 } // namespace util
75 } // namespace ndn
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
Definition: cs-internal.hpp:41
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.
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.