76         auto it = mAccessOrder.cbegin();  in dump()  local
77         for (size_t i = 0; i < n && it != mAccessOrder.cend(); ++i) {  in dump()
78             ss << *it++ << "\n";  in dump()
86         auto it = mMap.find(t);  in add()  local
87         if (it != mMap.end()) { // already exists.  in add()
88             mAccessOrder.erase(it->second);  // move-to-front on the chronologically ordered list.  in add()
105         auto it = mMap.find(t);  in remove()  local
106         if (it == mMap.end()) return false;  in remove()
107         mAccessOrder.erase(it->second);  in remove()
108         mMap.erase(it);  in remove()
114         auto it = mMap.find(t);  in check()  local
115         if (it == mMap.end()) return false;  in check()
116         mAccessOrder.erase(it->second);  in check()
117         mAccessOrder.push_front(it->first);  in check()
118         it->second = mAccessOrder.begin();  in check()