SynchronizedExpiringLinkedHashMap (ALEC :: Processor :: Redundant 2.1.1-ALPHA API)

java.lang.Object
- java.util.AbstractMap<K,V>
- - java.util.HashMap<K,V>
  - - java.util.LinkedHashMap<K,V>
    - - org.opennms.alec.processor.redundant.SynchronizedExpiringLinkedHashMap<K,V>

Type Parameters:

K - the key type

V - the value type

All Implemented Interfaces:

Serializable, Cloneable, Map<K,V>
```
public class SynchronizedExpiringLinkedHashMap<K,V>
extends LinkedHashMap<K,V>
```
A conditionally thread safe LinkedHashMap with keys that expire automatically after a predetermined delay.
This class is wrapped using Collections.synchronizedMap(java.util.Map<K, V>). Iteration of this map must be done only after acquiring a lock on the instance of this map.

See Also:

Serialized Form

Nested Class Summary
- Nested classes/interfaces inherited from class java.util.AbstractMap
  AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object,V extends Object>

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`void`	`clear()`
`V`	`put(K key, V value)`
`void`	`putAll(Map<? extends K,? extends V> m)`
`V`	`putIfAbsent(K key, V value)`
`V`	`replace(K key, V value)`
`boolean`	`replace(K key, V oldValue, V newValue)`
`void`	`replaceAll(BiFunction<? super K,? super V,? extends V> function)`

Methods inherited from class java.util.LinkedHashMap
containsValue, entrySet, forEach, get, getOrDefault, keySet, removeEldestEntry, values

Methods inherited from class java.util.HashMap
clone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, remove, remove, size

Methods inherited from class java.util.AbstractMap
equals, hashCode, toString

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, remove, remove, size

- Method Detail
  - clear
```
public void clear()
```
    Specified by:
    
    clear in interface Map<K,V>
    
    Overrides:
    
    clear in class LinkedHashMap<K,V>
  - put
```
public V put(K key,
             V value)
```
    Specified by:
    
    put in interface Map<K,V>
    
    Overrides:
    
    put in class HashMap<K,V>
  - putAll
```
public void putAll(Map<? extends K,? extends V> m)
```
    Specified by:
    
    putAll in interface Map<K,V>
    
    Overrides:
    
    putAll in class HashMap<K,V>
  - putIfAbsent
```
public V putIfAbsent(K key,
                     V value)
```
    Specified by:
    
    putIfAbsent in interface Map<K,V>
    
    Overrides:
    
    putIfAbsent in class HashMap<K,V>
  - replaceAll
```
public void replaceAll(BiFunction<? super K,? super V,? extends V> function)
```
    Specified by:
    
    replaceAll in interface Map<K,V>
    
    Overrides:
    
    replaceAll in class LinkedHashMap<K,V>
  - replace
```
public boolean replace(K key,
                       V oldValue,
                       V newValue)
```
    Specified by:
    
    replace in interface Map<K,V>
    
    Overrides:
    
    replace in class HashMap<K,V>
  - replace
```
public V replace(K key,
                 V value)
```
    Specified by:
    
    replace in interface Map<K,V>
    
    Overrides:
    
    replace in class HashMap<K,V>