58 words, 1 min read
⚠️ This post links to an external website. ⚠️
Today we’re going to implement a Least Recently Used Cache in C++23.
This structure is basically a fixed-size mapping of keys to values where the least recently used, or oldest, keys are evicted from the cache when adding new keys.
Fetching a value from the cache marks the key as most recently used as do successful insert operations.
continue reading on agentultra.com
If this post was enjoyable or useful for you, please share it! If you have comments, questions, or feedback, you can email my personal email. To get new posts, subscribe use the RSS feed.