#include <lru_cache.h>
|
| | LRUCache (const size_t capacity=kDefaultCapacity) |
| |
| | ~LRUCache () |
| |
| void | GetCache (std::map< K, V > *cache) |
| |
| V & | operator[] (const K &key) |
| |
| void | GetAllSilently (std::vector< V *> *ret) |
| |
| template<typename VV > |
| bool | Put (const K &key, VV &&val) |
| |
| template<typename VV > |
| bool | Update (const K &key, VV &&val) |
| |
| template<typename VV > |
| bool | UpdateSilently (const K &key, VV *val) |
| |
| template<typename VV > |
| bool | Add (const K &key, VV *val) |
| |
| template<typename VV > |
| bool | PutAndGetObsolete (const K &key, VV *val, K *obs) |
| |
| template<typename VV > |
| bool | AddAndGetObsolete (const K &key, VV *val, K *obs) |
| |
| V * | GetSilently (const K &key) |
| |
| V * | Get (const K &key) |
| |
| bool | GetCopySilently (const K &key, V *const val) |
| |
| bool | GetCopy (const K &key, V *const val) |
| |
| size_t | size () |
| |
| bool | Full () |
| |
| bool | Empty () |
| |
| size_t | capacity () |
| |
| Node< K, V > * | First () |
| |
| Node< K, V > * | Last () |
| |
| bool | Contains (const K &key) |
| |
| bool | Prioritize (const K &key) |
| |
| void | Clear () |
| |
| bool | Remove (const K &key) |
| |
| bool | ChangeCapacity (const size_t capacity) |
| |
◆ LRUCache()
template<class K, class V>
◆ ~LRUCache()
template<class K, class V>
◆ Add()
template<class K, class V>
template<typename VV >
◆ AddAndGetObsolete()
template<class K, class V>
template<typename VV >
◆ capacity()
template<class K, class V>
◆ ChangeCapacity()
template<class K, class V>
◆ Clear()
template<class K, class V>
◆ Contains()
template<class K, class V>
◆ Empty()
template<class K, class V>
◆ First()
template<class K, class V>
◆ Full()
template<class K, class V>
◆ Get()
template<class K, class V>
◆ GetAllSilently()
template<class K, class V>
◆ GetCache()
template<class K, class V>
◆ GetCopy()
template<class K, class V>
◆ GetCopySilently()
template<class K, class V>
◆ GetSilently()
template<class K, class V>
◆ Last()
template<class K, class V>
◆ operator[]()
template<class K, class V>
◆ Prioritize()
template<class K, class V>
◆ Put()
template<class K, class V>
template<typename VV >
◆ PutAndGetObsolete()
template<class K, class V>
template<typename VV >
◆ Remove()
template<class K, class V>
◆ size()
template<class K, class V>
◆ Update()
template<class K, class V>
template<typename VV >
◆ UpdateSilently()
template<class K, class V>
template<typename VV >
The documentation for this class was generated from the following file: