Adds or updates an item in the cache. If the item already exists, its rank position is refreshed by removing and adding the item back to the cache. If the item is not in the cache and maximum capacity hasn't been reached, the item is added to the cache. Otherwise, the eviction policy is applied and
(T item)
| 85 | * lowest rank in the cache. |
| 86 | */ |
| 87 | public synchronized void putOrUpdate(T item) { |
| 88 | if (!heap_.remove(item)) { |
| 89 | if (heap_.size() == maxCapacity_) { |
| 90 | if (!alwaysEvictAtCapacity_ && compareRanks(item, heap_.peek()) <= 0) { |
| 91 | return; |
| 92 | } |
| 93 | heap_.poll(); |
| 94 | } |
| 95 | } |
| 96 | heap_.add(item); |
| 97 | } |
| 98 | |
| 99 | /** |
| 100 | * Removes an item from the cache. |