NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.5: 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; -*- */
2 /*
3  * Copyright (c) 2013-2018 Regents of the University of California.
4  *
5  * This file is part of ndn-cxx library (NDN C++ library with eXperimental eXtensions).
6  *
7  * ndn-cxx library is free software: you can redistribute it and/or modify it under the
8  * terms of the GNU Lesser General Public License as published by the Free Software
9  * Foundation, either version 3 of the License, or (at your option) any later version.
10  *
11  * ndn-cxx library is distributed in the hope that it will be useful, but WITHOUT ANY
12  * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
13  * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
14  *
15  * You should have received copies of the GNU General Public License and GNU Lesser
16  * General Public License along with ndn-cxx, e.g., in COPYING.md file. If not, see
17  * <http://www.gnu.org/licenses/>.
18  *
19  * See AUTHORS.md for complete list of ndn-cxx authors and contributors.
20  */
21 
23 
24 namespace ndn {
25 
27  : InMemoryStorage(limit)
28 {
29 }
30 
32  : InMemoryStorage(ioService, limit)
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 ndn
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.
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
Definition: cs-internal.hpp:41
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...