Package de.mirkosertic.bytecoder.classlib.java.util

Class TWeakHashMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

de.mirkosertic.bytecoder.classlib.java.util.TWeakHashMap<K,V>

All Implemented Interfaces:

Map<K,V>

public class TWeakHashMap<K,V>
extends AbstractMap<K,V>
implements Map<K,V>

Nested Class Summary

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>

Field Summary

Fields

Modifier and Type	Field	Description
private final Map<K,V>	delegate

Constructor Summary

Constructors

Constructor	Description
TWeakHashMap()
TWeakHashMap(int capacity)

Method Summary

Modifier and Type	Method	Description
V	compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
V	computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)
V	computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
Set<Map.Entry<K,V>>	entrySet()
void	forEach(BiConsumer<? super K,? super V> action)
V	getOrDefault(Object key, V defaultValue)
V	merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)
V	putIfAbsent(K key, V value)
boolean	remove(Object key, Object 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.AbstractMap

clear, clone, containsKey, containsValue, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, toString, values

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Map

clear, containsKey, containsValue, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, values

Field Details

delegate

private final Map<K,V> delegate

Constructor Details

TWeakHashMap

public TWeakHashMap()

TWeakHashMap

public TWeakHashMap(int capacity)

Method Details

entrySet

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

Specified by:

entrySet in interface Map<K,V>

Specified by:

entrySet in class AbstractMap<K,V>

getOrDefault

public V getOrDefault(Object key,
 V defaultValue)

Specified by:

getOrDefault in interface Map<K,V>

forEach

public void forEach(BiConsumer<? super K,? super V> action)

Specified by:

forEach in interface Map<K,V>

replaceAll

public void replaceAll(BiFunction<? super K,? super V,? extends V> function)

Specified by:

replaceAll in interface Map<K,V>

putIfAbsent

public V putIfAbsent(K key,
 V value)

Specified by:

putIfAbsent in interface Map<K,V>

remove

public boolean remove(Object key,
 Object value)

Specified by:

remove in interface Map<K,V>

replace

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

Specified by:

replace in interface Map<K,V>

replace

public V replace(K key,
 V value)

Specified by:

replace in interface Map<K,V>

computeIfAbsent

public V computeIfAbsent(K key,
 Function<? super K,? extends V> mappingFunction)

Specified by:

computeIfAbsent in interface Map<K,V>

computeIfPresent

public V computeIfPresent(K key,
 BiFunction<? super K,? super V,? extends V> remappingFunction)

Specified by:

computeIfPresent in interface Map<K,V>

compute

public V compute(K key,
 BiFunction<? super K,? super V,? extends V> remappingFunction)

Specified by:

compute in interface Map<K,V>

merge

public V merge(K key,
 V value,
 BiFunction<? super V,? super V,? extends V> remappingFunction)

Specified by:

merge in interface Map<K,V>