#include <container.h>
◆ cache_entry_t
template<typename K , typename V >
typedef std::template pair<typename std::template list<K>::iterator, V> LRUCache< K, V >::cache_entry_t |
|
private |
◆ cache_type
template<typename K , typename V >
◆ LRUCache()
template<typename K , typename V >
LRUCache< K, V >::LRUCache |
( |
size_t | limit, |
|
|
void(* | cache_miss )(void *data, const K &key, V *dest), |
|
|
void * | data ) |
|
inline |
◆ invalidate()
template<typename K , typename V >
◆ lookupCache()
template<typename K , typename V >
const V * LRUCache< K, V >::lookupCache |
( |
K | key | ) |
|
|
inline |
◆ setLimit()
template<typename K , typename V >
void LRUCache< K, V >::setLimit |
( |
size_t | limit | ) |
|
|
inline |
◆ m_cache_miss
template<typename K , typename V >
void(* LRUCache< K, V >::m_cache_miss) (void *data, const K &key, V *dest) |
|
private |
◆ m_cache_miss_data
template<typename K , typename V >
void* LRUCache< K, V >::m_cache_miss_data |
|
private |
◆ m_limit
template<typename K , typename V >
◆ m_map
template<typename K , typename V >
◆ m_queue
template<typename K , typename V >
The documentation for this class was generated from the following file: