Lines Matching defs:m_cache
43 for (size_t i = 0; i < m_cache.size(); ++i) {
44 if (m_cache[i].first == key) {
46 if (foundIndex + 1 < m_cache.size()) {
47 Entry entry = m_cache[foundIndex];
48 m_cache.remove(foundIndex);
49 foundIndex = m_cache.size();
50 m_cache.append(entry);
52 return m_cache[foundIndex].second;
55 if (m_cache.size() == capacity)
56 m_cache.remove(0);
58 m_cache.append(std::make_pair(key, createValueForKey(key)));
59 return m_cache.last().second;
68 Cache m_cache;
