Class LRUCache<K,V>

java.lang.Object
java.util.AbstractMap<K,V>
com.cedarsoftware.util.LRUCache<K,V>
All Implemented Interfaces:
Map<K,V>

public class LRUCache<K,V> extends AbstractMap<K,V> implements Map<K,V>
This class provides a thread-safe Least Recently Used (LRU) cache API that will evict the least recently used items, once a threshold is met. It implements the Map interface for convenience. It is thread-safe via usage of ConcurrentHashMap for internal storage. The .get(), .remove(), and .put() APIs operate in O(1) without any blocking. A background thread monitors and cleans up the internal Map if it exceeds capacity. In addition, if .put() causes the background thread to be triggered to start immediately. This will keep the size of the LRUCache close to capacity even with bursty loads without reducing insertion (put) performance.

Author:
John DeRegnaucourt ([email protected])
Copyright (c) Cedar Software LLC

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

License

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.