mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-10-04 15:40:49 +00:00
59 lines
1.1 KiB
C++
59 lines
1.1 KiB
C++
//
|
|
// LRUCache.h
|
|
//
|
|
// $Id: //poco/1.4/Foundation/include/Poco/LRUCache.h#1 $
|
|
//
|
|
// Library: Foundation
|
|
// Package: Cache
|
|
// Module: LRUCache
|
|
//
|
|
// Definition of the LRUCache class.
|
|
//
|
|
// Copyright (c) 2006, Applied Informatics Software Engineering GmbH.
|
|
// and Contributors.
|
|
//
|
|
// SPDX-License-Identifier: BSL-1.0
|
|
//
|
|
|
|
|
|
#ifndef Foundation_LRUCache_INCLUDED
|
|
#define Foundation_LRUCache_INCLUDED
|
|
|
|
|
|
#include "Poco/AbstractCache.h"
|
|
#include "Poco/LRUStrategy.h"
|
|
|
|
|
|
namespace Poco {
|
|
|
|
|
|
template <
|
|
class TKey,
|
|
class TValue,
|
|
class TMutex = FastMutex,
|
|
class TEventMutex = FastMutex
|
|
>
|
|
class LRUCache: public AbstractCache<TKey, TValue, LRUStrategy<TKey, TValue>, TMutex, TEventMutex>
|
|
/// An LRUCache implements Least Recently Used caching. The default size for a cache is 1024 entries.
|
|
{
|
|
public:
|
|
LRUCache(long size = 1024):
|
|
AbstractCache<TKey, TValue, LRUStrategy<TKey, TValue>, TMutex, TEventMutex>(LRUStrategy<TKey, TValue>(size))
|
|
{
|
|
}
|
|
|
|
~LRUCache()
|
|
{
|
|
}
|
|
|
|
private:
|
|
LRUCache(const LRUCache& aCache);
|
|
LRUCache& operator = (const LRUCache& aCache);
|
|
};
|
|
|
|
|
|
} // namespace Poco
|
|
|
|
|
|
#endif // Foundation_LRUCache_INCLUDED
|