A cache with a fixed size that evicts the least recently used entry when it is full. The usual build is a hash map from key to list node plus a doubly linked list ordered by recency, so lookup, move-to-front and eviction are all O(1).
LRU cache
A cache with a fixed size that, when full, evicts the least recently used entry. Usually a map plus a doubly linked list.