|
|
using | key_type = K |
| |
|
using | value_type = V |
| |
|
using | dict_type = boost::unordered_map< K, std::pair< V, typename std::list< K >::iterator >, H > |
| |
|
|
| LRUCache (size_t sz=80) |
| |
|
size_t | size () const |
| |
|
size_t | capacity () const |
| |
|
bool | empty () const |
| |
|
bool | contains (const key_type &key) |
| |
|
template<typename... Args> |
| value_type * | insert (const key_type &key, Args &&...args) |
| |
|
void | erase (const key_type &key) |
| |
|
value_type * | find (const key_type &key) |
| |
|
template<class CompatibleKey , class CompatibleHash , class CompatiblePredicate > |
| value_type * | find (CompatibleKey const &k, CompatibleHash const &h, CompatiblePredicate const &p) |
| |
|
void | clear () |
| |
template<typename K, typename V, typename H = boost::hash<K>>
class libime::LRUCache< K, V, H >
Definition at line 19 of file lrucache.h.
The documentation for this class was generated from the following file:
