add(const Key &key, EntryValue *t) | LruMap< Key, EntryValue, EntryCost > | |
del(const Key &key) | LruMap< Key, EntryValue, EntryCost > | |
del(const MapIterator &i) | LruMap< Key, EntryValue, EntryCost > | private |
entries() const | LruMap< Key, EntryValue, EntryCost > | inline |
entries_ | LruMap< Key, EntryValue, EntryCost > | private |
expired(const Entry &e) const | LruMap< Key, EntryValue, EntryCost > | private |
findEntry(const Key &key, LruMap::MapIterator &i) | LruMap< Key, EntryValue, EntryCost > | private |
freeMem() const | LruMap< Key, EntryValue, EntryCost > | inline |
get(const Key &key) | LruMap< Key, EntryValue, EntryCost > | |
index | LruMap< Key, EntryValue, EntryCost > | private |
LruMap(int ttl, size_t size) | LruMap< Key, EntryValue, EntryCost > | |
LruMap(LruMap const &) | LruMap< Key, EntryValue, EntryCost > | private |
Map typedef | LruMap< Key, EntryValue, EntryCost > | |
MapIterator typedef | LruMap< Key, EntryValue, EntryCost > | |
MapPair typedef | LruMap< Key, EntryValue, EntryCost > | |
memLimit() const | LruMap< Key, EntryValue, EntryCost > | inline |
memLimit_ | LruMap< Key, EntryValue, EntryCost > | private |
operator=(LruMap const &) | LruMap< Key, EntryValue, EntryCost > | private |
Queue typedef | LruMap< Key, EntryValue, EntryCost > | |
QueueIterator typedef | LruMap< Key, EntryValue, EntryCost > | |
setMemLimit(size_t aSize) | LruMap< Key, EntryValue, EntryCost > | |
size() const | LruMap< Key, EntryValue, EntryCost > | inline |
storage | LruMap< Key, EntryValue, EntryCost > | private |
touch(const MapIterator &i) | LruMap< Key, EntryValue, EntryCost > | private |
trim() | LruMap< Key, EntryValue, EntryCost > | private |
ttl | LruMap< Key, EntryValue, EntryCost > | private |
~LruMap() | LruMap< Key, EntryValue, EntryCost > | |