index.erase(i->second);
i->second = index.begin();
- LruMap::Entry *e = *i->second;
+ Entry *e = *i->second;
if (e && expired(*e)) {
del(i);
EntryValue *
LruMap<EntryValue, EntryCost>::get(const char *key)
{
- LruMap::MapIterator i;
+ MapIterator i;
findEntry(key, i);
- LruMap::Entry *e = *i->second;
+ Entry *e = *i->second;
if (i != storage.end()) {
touch(i);
return e->value;
bool
LruMap<EntryValue, EntryCost>::del(const char *key)
{
- LruMap::MapIterator i;
+ MapIterator i;
findEntry(key, i);
return del(i);
}
LruMap<EntryValue, EntryCost>::trim()
{
while (memLimit() > 0 && size() >= memLimit()) {
- LruMap::QueueIterator i = index.end();
+ QueueIterator i = index.end();
--i;
if (i != index.end()) {
del((*i)->key.c_str());