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 
32 InMemoryStorageLfu::InMemoryStorageLfu(boost::asio::io_service& ioService, size_t limit)
33  : InMemoryStorage(ioService, limit)
34 {
35 }
36 
38 {
39 }
40 
41 void
43 {
44  BOOST_ASSERT(m_cleanupIndex.size() <= size());
45  CleanupEntry cleanupEntry;
46  cleanupEntry.entry = entry;
47  cleanupEntry.frequency = 0;
48  m_cleanupIndex.insert(cleanupEntry);
49 }
50 
51 bool
53 {
54  if (!m_cleanupIndex.get<byFrequency>().empty()) {
55  CleanupIndex::index<byFrequency>::type::iterator it = m_cleanupIndex.get<byFrequency>().begin();
56  eraseImpl(((*it).entry)->getFullName());
57  m_cleanupIndex.get<byFrequency>().erase(it);
58  return true;
59  }
60 
61  return false;
62 }
63 
64 void
66 {
67  CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
68  if (it != m_cleanupIndex.get<byEntity>().end())
69  m_cleanupIndex.get<byEntity>().erase(it);
70 }
71 
72 void
74 {
75  CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
76  m_cleanupIndex.get<byEntity>().modify(it, &incrementFrequency);
77 }
78 
79 } // namespace util
80 } // 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.
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
InMemoryStorage::const_iterator begin() const
Returns begin iterator of the in-memory storage ordering by name with digest.
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.