libboxes
boxes is a set of specialised containers built on top of STL
|
Eviction policy that evicts the least frequently used element. More...
#include <cache.hpp>
Public Member Functions | |
void | clear () |
Clears the eviction policy. More... | |
K & | front () |
Returns the reference to the first element in the cache. More... | |
K & | back () |
Returns the reference to the last element in the cache. More... | |
Iterator | begin () |
Returns an iterator to the first element in the cache. More... | |
Iterator | end () |
Returns an iterator to the element following the last element in the cache. More... | |
const K * | elect () |
Elects the least frequently used element for eviction. More... | |
Eviction policy that evicts the least frequently used element.
The order of elements in the cache is defined by the frequency of access. The most frequently used element (and least likely to be evicted) is stored at the front of the queue.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |