org.jboss.as.security.lru

Class LRUCache<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

org.jboss.as.security.lru.LRUCache<K,V>

All Implemented Interfaces:

ConcurrentMap<K,V>, Map<K,V>

public class LRUCache<K,V>
extends AbstractMap<K,V>
implements ConcurrentMap<K,V>

A non-blocking cache where entries are indexed by a key.

To reduce contention, entry allocation and eviction execute in a sampling fashion (entry hits modulo N). Eviction follows an LRU approach (oldest sampled entries are removed first) when the cache is out of capacity.

Author:

Jason T. Greene

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	LRUCache.CacheEntry<K,V>

Nested classes/interfaces inherited from class java.util.AbstractMap

AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Constructor Summary

Constructors

Constructor and Description
LRUCache(int maxEntries)
LRUCache(int maxEntries, RemoveCallback<K,V> removeCallback)

Method Summary

Modifier and Type	Method and Description
void	clear()
Set<Map.Entry<K,V>>	entrySet()
V	get(Object key)
V	put(K key, V newValue)
V	put(K key, V newValue, boolean ifAbsent)
V	putIfAbsent(K key, V value)
V	remove(Object key)
boolean	remove(Object key, Object value)
V	replace(K key, V newValue)
boolean	replace(K key, V oldValue, V newValue)
int	size()

Methods inherited from class java.util.AbstractMap

clone, containsKey, containsValue, equals, hashCode, isEmpty, keySet, putAll, toString, values

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.concurrent.ConcurrentMap

compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, replaceAll

Methods inherited from interface java.util.Map

containsKey, containsValue, equals, hashCode, isEmpty, keySet, putAll, values

Constructor Detail

LRUCache

public LRUCache(int maxEntries)

LRUCache

public LRUCache(int maxEntries,
                RemoveCallback<K,V> removeCallback)

Method Detail

put

public V put(K key,
             V newValue)

Specified by:

put in interface Map<K,V>

Overrides:

put in class AbstractMap<K,V>

put

public V put(K key,
             V newValue,
             boolean ifAbsent)

replace

public V replace(K key,
                 V newValue)

Specified by:

replace in interface ConcurrentMap<K,V>

Specified by:

replace in interface Map<K,V>

replace

public boolean replace(K key,
                       V oldValue,
                       V newValue)

Specified by:

replace in interface ConcurrentMap<K,V>

Specified by:

replace in interface Map<K,V>

get

public V get(Object key)

Specified by:

get in interface Map<K,V>

Overrides:

get in class AbstractMap<K,V>

remove

public boolean remove(Object key,
                      Object value)

Specified by:

remove in interface ConcurrentMap<K,V>

Specified by:

remove in interface Map<K,V>

remove

public V remove(Object key)

Specified by:

remove in interface Map<K,V>

Overrides:

remove in class AbstractMap<K,V>

clear

public void clear()

Specified by:

clear in interface Map<K,V>

Overrides:

clear in class AbstractMap<K,V>

size

public int size()

Specified by:

size in interface Map<K,V>

Overrides:

size in class AbstractMap<K,V>

entrySet

public Set<Map.Entry<K,V>> entrySet()

Specified by:

entrySet in interface Map<K,V>

Specified by:

entrySet in class AbstractMap<K,V>

putIfAbsent

public V putIfAbsent(K key,
                     V value)

Specified by:

putIfAbsent in interface ConcurrentMap<K,V>

Specified by:

putIfAbsent in interface Map<K,V>