Class LimitMap<K,V>
java.lang.Object
dev.resteasy.client.util.common.LimitMap<K,V>
- All Implemented Interfaces:
Map<K,
V>
A simple map which limits the number of entries allowed.
- Author:
- James R. Perkins
-
Nested Class Summary
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
computeIfAbsent
(K key, Function<? super K, ? extends V> mappingFunction) computeIfPresent
(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) boolean
containsKey
(Object key) boolean
containsValue
(Object value) entrySet()
boolean
void
forEach
(BiConsumer<? super K, ? super V> action) getOrDefault
(Object key, V defaultValue) int
hashCode()
boolean
isEmpty()
keySet()
static <K,
V> LimitMap <K, V> of
(int limit) Creates a map which limits the entries.void
putIfAbsent
(K key, V value) boolean
boolean
void
replaceAll
(BiFunction<? super K, ? super V, ? extends V> function) int
size()
values()
-
Constructor Details
-
LimitMap
public LimitMap(int limit) Creates a map which limits the entries.- Parameters:
limit
- the maximum amount of entries allowed, must be greater than 0
-
-
Method Details
-
of
Creates a map which limits the entries.- Parameters:
limit
- the maximum amount of entries allowed, must be greater than 0
-
size
-
isEmpty
-
containsKey
- Specified by:
containsKey
in interfaceMap<K,
V>
-
containsValue
- Specified by:
containsValue
in interfaceMap<K,
V>
-
get
-
put
-
remove
-
putAll
-
clear
-
keySet
-
values
-
entrySet
-
equals
-
hashCode
-
getOrDefault
-
forEach
-
replaceAll
- Specified by:
replaceAll
in interfaceMap<K,
V>
-
putIfAbsent
-
remove
-
replace
-
replace
-
computeIfAbsent
-
computeIfPresent
- Specified by:
computeIfPresent
in interfaceMap<K,
V>
-
compute
-
merge
-