Multi reader/writer cache/buffer

media/blink/lru.h

+// Copyright 2015 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef MEDIA_BLINK_LRU_H_
+#define MEDIA_BLINK_LRU_H_
+
+#include <list>
+#include <map>
+
+namespace media {
+
+template<typename T>
+class LRU {
+ public:
+  // Adds |x| to LRU.
+  // |x| must not already be in the LRU.
+  void Insert(const T& x) {
+    DCHECK(!Contains(x));
+    lru_.push_front(x);
+    pos_[x] = lru_.begin();
+  }
+
+  // Removes |x| from LRU.
+  // |x| must be in the LRU.
+  void Remove(const T& x) {
+    DCHECK(Contains(x)) << " x = " << x;
+    lru_.erase(pos_[x]);
+    pos_.erase(x);
+  }
+
+  // Moves |x| to front of LRU. (most recently used)
+  // If |x| is not in LRU, it is added.
+  void Use(const T& x) {
+    if (Contains(x)) Remove(x);
+    Insert(x);
+  }
+
+  bool Empty() const {
+    return lru_.empty();
+  }
+
+  // Returns the Least Recently Used T.
+  T Pop() {
+    DCHECK(!Empty());
+    T ret = lru_.back();
+    lru_.pop_back();
+    pos_.erase(ret);
+    return ret;
+  }
+
+  T Peek() const {
+    DCHECK(!Empty());
+    return lru_.back();
+  }
+
+  bool Contains(const T& x) const {
+    return pos_.find(x) != pos_.end();
+  }
+ private:
+  std::list<T> lru_;
+  std::map<T, typename std::list<T>::iterator> pos_;
+};
+
+}  // namespace media
+
+#endif  // MEDIA_BLINK_LRU_H