summaryrefslogtreecommitdiffstats
path: root/src/base/lrucache.hpp
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-05-04 17:44:55 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-05-04 17:44:55 +0000
commit5068d34c08f951a7ea6257d305a1627b09a95817 (patch)
tree08213e2be853396a3b07ce15dbe222644dcd9a89 /src/base/lrucache.hpp
parentInitial commit. (diff)
downloadlnav-upstream.tar.xz
lnav-upstream.zip
Adding upstream version 0.11.1.upstream/0.11.1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
-rw-r--r--src/base/lrucache.hpp83
1 files changed, 83 insertions, 0 deletions
diff --git a/src/base/lrucache.hpp b/src/base/lrucache.hpp
new file mode 100644
index 0000000..8bcbad6
--- /dev/null
+++ b/src/base/lrucache.hpp
@@ -0,0 +1,83 @@
+/*
+ * File: lrucache.hpp
+ * Author: Alexander Ponomarev
+ *
+ * Created on June 20, 2013, 5:09 PM
+ */
+
+#ifndef _LRUCACHE_HPP_INCLUDED_
+#define _LRUCACHE_HPP_INCLUDED_
+
+#include <map>
+#include <list>
+#include <cstddef>
+#include <stdexcept>
+
+#include "optional.hpp"
+
+namespace cache {
+
+template<typename key_t, typename value_t>
+class lru_cache {
+public:
+ typedef typename std::pair<key_t, value_t> key_value_pair_t;
+ typedef typename std::list<key_value_pair_t>::iterator list_iterator_t;
+
+ lru_cache(size_t max_size) :
+ _max_size(max_size) {
+ }
+
+ void put(const key_t& key, const value_t& value) {
+ auto it = _cache_items_map.find(key);
+ _cache_items_list.push_front(key_value_pair_t(key, value));
+ if (it != _cache_items_map.end()) {
+ _cache_items_list.erase(it->second);
+ _cache_items_map.erase(it);
+ }
+ _cache_items_map[key] = _cache_items_list.begin();
+
+ if (_cache_items_map.size() > _max_size) {
+ auto last = _cache_items_list.end();
+ last--;
+ _cache_items_map.erase(last->first);
+ _cache_items_list.pop_back();
+ }
+ }
+
+ nonstd::optional<value_t> get(const key_t& key) {
+ auto it = _cache_items_map.find(key);
+ if (it == _cache_items_map.end()) {
+ return nonstd::nullopt;
+ }
+
+ _cache_items_list.splice(_cache_items_list.begin(), _cache_items_list, it->second);
+ return it->second->second;
+ }
+
+ bool exists(const key_t& key) const {
+ return _cache_items_map.find(key) != _cache_items_map.end();
+ }
+
+ size_t size() const {
+ return _cache_items_map.size();
+ }
+
+ void set_max_size(size_t max_size) {
+ this->_max_size = max_size;
+ }
+
+ void clear() {
+ this->_cache_items_map.clear();
+ this->_cache_items_list.clear();
+ }
+
+private:
+ std::list<key_value_pair_t> _cache_items_list;
+ std::map<key_t, list_iterator_t> _cache_items_map;
+ size_t _max_size;
+};
+
+} // namespace cache
+
+#endif /* _LRUCACHE_HPP_INCLUDED_ */
+