Dune::lru< _Key, _Tp, _Traits > Class Template Reference
LRU Cache Container.
More...
#include <dune/common/lru.hh>
List of all members.
Detailed Description
template<typename _Key, typename _Tp, typename _Traits = _lru_default_traits<_Key, _Tp>>
class Dune::lru< _Key, _Tp, _Traits >
LRU Cache Container.
Implementation of an LRU (least recently used) cache container. This implementation follows the approach presented in http://aim.adc.rmit.edu.au/phd/sgreuter/papers/graphite2003.pdf
Member Typedef Documentation
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Member Function Documentation
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Returns a read-only (constant) reference to the data of the least recently used entry.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Returns a read/write reference to the data of the least recently used entry.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
void Dune::lru< _Key, _Tp, _Traits >::clear |
( |
|
) |
[inline] |
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Finds the element whose key is k.
- Returns:
- const_iterator
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Finds the element whose key is k.
- Returns:
- iterator
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Returns a read-only (constant) reference to the data of the most recently used entry.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Returns a read/write reference to the data of the most recently used entry.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
mark data associated with key as most recent
- Returns:
- reference of stored data
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Insert a value into the container.
Stores value under key and marks it as most recent. If this key is already present, the associated data is replaced.
- Parameters:
-
| key | associated with data |
| data | to store |
- Returns:
- reference of stored data
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
void Dune::lru< _Key, _Tp, _Traits >::pop_back |
( |
|
) |
[inline] |
Removes the last element.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
void Dune::lru< _Key, _Tp, _Traits >::pop_front |
( |
|
) |
[inline] |
Removes the first element.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
ensure a maximum size of the container
If new_size is smaller than size the oldest elements are dropped. Otherwise nothing happens.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
Retrieve number of entries in the container.
template<typename _Key , typename _Tp , typename _Traits = _lru_default_traits<_Key, _Tp>>
mark data associated with key as most recent
- Returns:
- reference of stored data
The documentation for this class was generated from the following file: