LruCache provides a least-recently-used cache abstraction. More...
#include <LruCache.h>
Inheritance diagram for LruCache< K, T, Slots >:
Collaboration diagram for LruCache< K, T, Slots >:
Classes | |
| struct | Slot |
Public Member Functions | |
| bool | get (const K &key, T &object) |
| void | store (const K &key, const T &object) |
| size_t | hits () const |
| size_t | misses () const |
Private Attributes | |
| Slot | m_Slots [Slots] |
| size_t | m_Hits = 0 |
| size_t | m_Misses = 0 |
Detailed Description
template<class K, class T, size_t Slots = 32>
class LruCache< K, T, Slots >
class LruCache< K, T, Slots >
LruCache provides a least-recently-used cache abstraction.
A key type is used to find items within the cache.
It is recommended that the type T is relatively small and has a low cost to copy (a scalar type is best) for maximum performance.
Definition at line 38 of file LruCache.h.
Member Function Documentation
◆ get()
template<class K , class T , size_t Slots = 32>
|
inline |
Potentially get an item with the given key.
Definition at line 53 of file LruCache.h.
◆ hits()
template<class K , class T , size_t Slots = 32>
|
inline |
Definition at line 87 of file LruCache.h.
◆ misses()
template<class K , class T , size_t Slots = 32>
|
inline |
Definition at line 91 of file LruCache.h.
◆ store()
template<class K , class T , size_t Slots = 32>
|
inline |
Store an item as the most recently used item.
Definition at line 71 of file LruCache.h.
Member Data Documentation
◆ m_Hits
template<class K , class T , size_t Slots = 32>
|
private |
Definition at line 98 of file LruCache.h.
◆ m_Misses
template<class K , class T , size_t Slots = 32>
|
private |
Definition at line 99 of file LruCache.h.
◆ m_Slots
template<class K , class T , size_t Slots = 32>
|
private |
Definition at line 96 of file LruCache.h.
The documentation for this class was generated from the following file:
