#include <cache_adt.h>
template<typename Key , typename Entry >
template<typename Key , typename Entry >
template<typename Key , typename Entry >
template<typename Key , typename Entry >
void LRU< Key, Entry >::add |
( |
const Key & |
key, |
|
|
const Entry & |
entry |
|
) |
| |
|
inline |
template<typename Key , typename Entry >
template<typename Key , typename Entry >
bool LRU< Key, Entry >::find |
( |
const Key & |
key, |
|
|
const Entry ** |
pentry |
|
) |
| const |
|
inline |
template<typename Key , typename Entry >
template<typename Key , typename Entry >
void LRU< Key, Entry >::remove |
( |
const Key & |
key | ) |
|
|
inline |
template<typename Key , typename Entry >
void LRU< Key, Entry >::remove_least_valuable |
( |
std::list< Entry > & |
entry_list | ) |
|
|
inline |
template<typename Key , typename Entry >
The documentation for this class was generated from the following file: