util: in-memory storage
refs #1940
specification:
http://redmine.named-data.net/projects/ndn-cxx/wiki/InMemoryStorage
Change-Id: I7416d0dac4b4865ad931c3bf83180a043788405b
diff --git a/src/util/in-memory-storage-lfu.cpp b/src/util/in-memory-storage-lfu.cpp
new file mode 100644
index 0000000..0596145
--- /dev/null
+++ b/src/util/in-memory-storage-lfu.cpp
@@ -0,0 +1,75 @@
+/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
+/**
+ * Copyright (c) 2013-2014 Regents of the University of California.
+ *
+ * This file is part of ndn-cxx library (NDN C++ library with eXperimental eXtensions).
+ *
+ * ndn-cxx library is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Lesser General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * ndn-cxx library is distributed in the hope that it will be useful, but WITHOUT ANY
+ * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+ * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+ *
+ * You should have received copies of the GNU General Public License and GNU Lesser
+ * General Public License along with ndn-cxx, e.g., in COPYING.md file. If not, see
+ * <http://www.gnu.org/licenses/>.
+ *
+ * See AUTHORS.md for complete list of ndn-cxx authors and contributors.
+ */
+
+#include "in-memory-storage-lfu.hpp"
+
+namespace ndn {
+namespace util {
+
+InMemoryStorageLfu::InMemoryStorageLfu(size_t limit)
+ : InMemoryStorage(limit)
+{
+}
+
+InMemoryStorageLfu::~InMemoryStorageLfu()
+{
+}
+
+void
+InMemoryStorageLfu::afterInsert(InMemoryStorageEntry* entry)
+{
+ BOOST_ASSERT(m_cleanupIndex.size() <= size());
+ CleanupEntry cleanupEntry;
+ cleanupEntry.entry = entry;
+ cleanupEntry.frequency = 0;
+ m_cleanupIndex.insert(cleanupEntry);
+}
+
+bool
+InMemoryStorageLfu::evictItem()
+{
+ if (!m_cleanupIndex.get<byFrequency>().empty()) {
+ CleanupIndex::index<byFrequency>::type::iterator it = m_cleanupIndex.get<byFrequency>().begin();
+ eraseImpl(((*it).entry)->getFullName());
+ m_cleanupIndex.get<byFrequency>().erase(it);
+ return true;
+ }
+
+ return false;
+}
+
+void
+InMemoryStorageLfu::beforeErase(InMemoryStorageEntry* entry)
+{
+ CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
+ if (it != m_cleanupIndex.get<byEntity>().end())
+ m_cleanupIndex.get<byEntity>().erase(it);
+}
+
+void
+InMemoryStorageLfu::afterAccess(InMemoryStorageEntry* entry)
+{
+ CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
+ m_cleanupIndex.get<byEntity>().modify(it, &incrementFrequency);
+}
+
+} // namespace util
+} // namespace ndn