47 auto [it, added] = entries.try_emplace(std::move(key));
48 it->second.value = std::move(value);
50 order.splice(order.begin(), order, it->second.used);
53 order.push_front(&it->first);
54 it->second.used = order.begin();
55 if (entries.size() > capacity) {
56 auto oldest = entries.find(*order.back());
58 entries.erase(oldest);