lru_map: don't use list::size()

replace list::size() with map::size(), which should have
a constant time complexity.

Reviewed-by: Sage Weil <sage@inktank.com>
Signed-off-by: Yehuda Sadeh <yehuda@inktank.com>
(cherry picked from commit 7c1d2ded8fa8061bf3f14932800998b963745dd1)

diff --git a/src/common/lru_map.h b/src/common/lru_map.h
index aa0b339b834e27d779c4e851f6e2dd2fa4bfa8a5..6e7f7b3786fa2acb0fc33cd82983493027fa1cf9 100644 (file)
--- a/src/common/lru_map.h
+++ b/src/common/lru_map.h
@@ -67,7 +67,7 @@ void lru_map<K, V>::add(const K& key, V& value)
   e.value = value;
   e.lru_iter = entries_lru.begin();
 
-  while (entries_lru.size() > max) {
+  while (entries.size() > max) {
     typename std::list<K>::reverse_iterator riter = entries_lru.rbegin();
     iter = entries.find(*riter);
     // assert(iter != entries.end());