blob: 77896708603c0e9625b4a183402a61fdcfc48fb5 [file] [log] [blame]
// Copyright (c) 2016 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.
#include <memory>
#include "net/quic/platform/impl/quic_lru_cache_impl.h"
namespace quic {
// A LRU cache that maps from type Key to Value* in QUIC.
// This cache CANNOT be shared by multiple threads (even with locks) because
// Value* returned by Lookup() can be invalid if the entry is evicted by other
// threads.
template <class K, class V>
class QuicLRUCacheOld {
explicit QuicLRUCacheOld(int64_t total_units) : impl_(total_units) {}
QuicLRUCacheOld(const QuicLRUCacheOld&) = delete;
QuicLRUCacheOld& operator=(const QuicLRUCacheOld&) = delete;
// Inserts one unit of |key|, |value| pair to the cache. Cache takes ownership
// of inserted |value|.
void Insert(const K& key, std::unique_ptr<V> value) {
impl_.Insert(key, std::move(value));
// If cache contains an entry for |key|, return a pointer to it. This returned
// value is guaranteed to be valid until Insert or Clear.
// Else return nullptr.
V* Lookup(const K& key) { return impl_.Lookup(key); }
// Removes all entries from the cache. This method MUST be called before
// destruction.
void Clear() { impl_.Clear(); }
// Returns maximum size of the cache.
int64_t MaxSize() const { return impl_.MaxSize(); }
// Returns current size of the cache.
int64_t Size() const { return impl_.Size(); }
QuicLRUCacheImpl<K, V> impl_;
} // namespace quic