Question: Is there a data structure for [key,value] entries that has very fast look-ups, with limited size, that can throw away entries based on how old they ar
