This should get us better look up speeds.
Signed-off-by: Adam C. Emerson <aemerson@redhat.com>
return -ENOENT;
}
- map<string, ObjectCacheEntry>::iterator iter = cache_map.find(name);
+ auto iter = cache_map.find(name);
if (iter == cache_map.end()) {
ldout(cct, 10) << "cache get: name=" << name << " : miss" << dendl;
if(perfcounter) perfcounter->inc(l_rgw_cache_miss);
return;
}
- map<string, ObjectCacheEntry>::iterator iter = cache_map.find(name);
+ auto iter = cache_map.find(name);
if (iter == cache_map.end())
return;
#include "rgw_rados.h"
#include <string>
#include <map>
+#include <unordered_map>
#include "include/types.h"
#include "include/utime.h"
#include "include/assert.h"
};
class ObjectCache {
- std::map<string, ObjectCacheEntry> cache_map;
+ std::unordered_map<string, ObjectCacheEntry> cache_map;
std::deque<string> lru;
unsigned long lru_size;
unsigned long lru_counter;