Dictionary or similar data structure that only stores the most recent n entries?
Question
I'm wondering if there's a built-in Java data structure that behaves like a dictionary but only keeps a fixed number of recent entries. So I could keep the size more-or-less constant but also have it behave like a dictionary or hashmap.
2 answers
solution1
1 2013-02-12 20:42:44
You could create one quite easily by extending LinkedHashMap. When adding an entry, check the size and remove the oldest item if already at maximum size.
solution2
0 2013-02-13 13:04:07
我认为LRUMap将适合您的需求。
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
HashMap with only most recent entries
Data Structure for an array of Dictionary entries
Fixed size log file containing only the most recent entries
Is there a data structure that only stores hash codes and not the actual objects?
Run computation on only the most recent, asynchronously updating data
Query the most recent entries in a collection in Java
Auto-Generated Spring data query for MongoDB: X most recent entries
In Java, which is the most recommended class for a dictionary data structure?
How do I create an array loop where only the most recent n particles are drawn?
How to make a data structure which can hold 100 most recent record_values basis on timestamp?
Related Tags