blob: 059614500e73b324ecaa3a16a7b1f6e312e22d21 [file] [log] [blame]
Jiewen Tan99135962014-09-20 02:18:53 -07001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
3 * Copyright (c) 2013-2014 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
22#include "in-memory-storage-lfu.hpp"
23
24namespace ndn {
25namespace util {
26
27InMemoryStorageLfu::InMemoryStorageLfu(size_t limit)
28 : InMemoryStorage(limit)
29{
30}
31
32InMemoryStorageLfu::~InMemoryStorageLfu()
33{
34}
35
36void
37InMemoryStorageLfu::afterInsert(InMemoryStorageEntry* entry)
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
46bool
47InMemoryStorageLfu::evictItem()
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
59void
60InMemoryStorageLfu::beforeErase(InMemoryStorageEntry* entry)
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
67void
68InMemoryStorageLfu::afterAccess(InMemoryStorageEntry* entry)
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