General purpose LRU cache map. Accessing an entry will keep the entry cached. get(const KEY&) and put(const KEY&, const VALUE&) results in an access to the corresponding entry.
More...
#include <SimpleLRUCache.h>
template<class KEY, class VALUE, class HASH, class EQUAL>
class Lucene::SimpleLRUCache< KEY, VALUE, HASH, EQUAL >
General purpose LRU cache map. Accessing an entry will keep the entry cached. get(const KEY&) and put(const KEY&, const VALUE&) results in an access to the corresponding entry.
◆ const_iterator
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ key_list
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ key_value
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ map_iterator
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ map_type
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ SimpleLRUCache()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ ~SimpleLRUCache()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ begin()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ contains()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ end()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ get()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ put()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ size()
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ cacheList
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ cacheMap
template<class KEY , class VALUE , class HASH , class EQUAL >
◆ cacheSize
template<class KEY , class VALUE , class HASH , class EQUAL >
The documentation for this class was generated from the following file: