89         typename LruCacheSet::iterator result = mSet->find(&entryForSearch);  in findByKey()
93     std::unique_ptr<LruCacheSet> mSet;  variable
108                 mCache(cache), mIterator(mCache.mSet->begin()), mBeginReturned(false) {  in Iterator()
112             if (mIterator == mCache.mSet->end()) {  in next()
122             bool ret = (mIterator != mCache.mSet->end());  in next()
143     : mSet(new LruCacheSet())  in LruCache()
149     mSet->max_load_factor(1.0);  in LruCache()
165     return mSet->size();  in size()
171     if (find_result == mSet->end()) {  in get()
186     if (findByKey(key) != mSet->end()) {  in put()
191     mSet->insert(newEntry);  in put()
199     if (find_result == mSet->end()) {  in remove()
203     mSet->erase(entry);  in remove()
238     for (auto entry : *mSet.get()) {  in clear()
241     mSet->clear();  in clear()