111         auto index = std::lower_bound(mCacheEntries.begin(), mCacheEntries.end(), dummyEntry);  in set()
112         if (index == mCacheEntries.end() || dummyEntry < *index) {  in set()
138             mCacheEntries.insert(index, CacheEntry(keyBlob, valueBlob, ++mAccessCount));  in set()
151                                index - mCacheEntries.begin())) {  in set()
195     auto index = std::lower_bound(mCacheEntries.begin(), mCacheEntries.end(), dummyEntry);  in get()
196     if (index == mCacheEntries.end() || dummyEntry < *index) {  in get()
225     for (const CacheEntry& e : mCacheEntries) {  in getFlattenedSize()
243     header->mNumEntries = mCacheEntries.size();  in flatten()
251     for (const CacheEntry& e : mCacheEntries) {  in flatten()
285     mCacheEntries.clear();  in unflatten()
312             mCacheEntries.clear();  in unflatten()
324             mCacheEntries.clear();  in unflatten()
349             return size_t(blob_random() % (mCacheEntries.size()));  in findVictim()
351             return std::min_element(mCacheEntries.begin(), mCacheEntries.end(),  in findVictim()
355                    mCacheEntries.begin();  in findVictim()
365         const auto& entry = mCacheEntries[onBehalfOf];  in findDownTo()
402         const CacheEntry& entry(mCacheEntries[i]);  in clean()
405         mCacheEntries.erase(mCacheEntries.begin() + i);  in clean()