Searched refs:mAccessOrder (Results 1 – 1 of 1) sorted by relevance
40 std::list<T> mAccessOrder; // front is the most recent, back is the oldest. variable70 mAccessOrder.clear(); in clear()76 auto it = mAccessOrder.cbegin(); in dump()77 for (size_t i = 0; i < n && it != mAccessOrder.cend(); ++i) { in dump()88 mAccessOrder.erase(it->second); // move-to-front on the chronologically ordered list. in add()89 } else if (mAccessOrder.size() >= mMaxSize) { in add()90 const T last = mAccessOrder.back(); in add()91 mAccessOrder.pop_back(); in add()94 mAccessOrder.push_front(t); in add()95 mMap[t] = mAccessOrder.begin(); in add()[all …]