K
- the type of keys maintained by this mapV
- the type of mapped valuesTrieMap
instead.@Deprecated public abstract class TrieMap<K,V> extends com.google.common.collect.ForwardingObject implements ConcurrentMap<K,V>, Serializable
Modifier and Type | Method and Description |
---|---|
void |
clear()
Deprecated.
|
V |
compute(K key,
BiFunction<? super K,? super V,? extends V> remappingFunction)
Deprecated.
|
V |
computeIfAbsent(K key,
Function<? super K,? extends V> mappingFunction)
Deprecated.
|
V |
computeIfPresent(K key,
BiFunction<? super K,? super V,? extends V> remappingFunction)
Deprecated.
|
boolean |
containsKey(Object key)
Deprecated.
|
boolean |
containsValue(Object value)
Deprecated.
|
static <K,V> MutableTrieMap<K,V> |
create()
Deprecated.
|
protected tech.pantheon.triemap.TrieMap<K,V> |
delegate()
Deprecated.
|
Set<Map.Entry<K,V>> |
entrySet()
Deprecated.
|
boolean |
equals(Object o)
Deprecated.
|
V |
get(Object key)
Deprecated.
|
int |
hashCode()
Deprecated.
|
abstract ImmutableTrieMap<K,V> |
immutableSnapshot()
Deprecated.
Returns a read-only snapshot of this TrieMap.
|
boolean |
isEmpty()
Deprecated.
|
Set<K> |
keySet()
Deprecated.
|
V |
merge(K key,
V value,
BiFunction<? super V,? super V,? extends V> remappingFunction)
Deprecated.
|
abstract TrieMap<K,V> |
mutableSnapshot()
Deprecated.
Returns a snapshot of this TrieMap.
|
V |
put(K key,
V value)
Deprecated.
|
void |
putAll(Map<? extends K,? extends V> m)
Deprecated.
|
V |
putIfAbsent(K key,
V value)
Deprecated.
|
V |
remove(Object key)
Deprecated.
|
boolean |
remove(Object key,
Object value)
Deprecated.
|
V |
replace(K key,
V value)
Deprecated.
|
boolean |
replace(K key,
V oldValue,
V newValue)
Deprecated.
|
int |
size()
Deprecated.
|
Collection<V> |
values()
Deprecated.
|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
forEach, getOrDefault, replaceAll
public static <K,V> MutableTrieMap<K,V> create()
public abstract TrieMap<K,V> mutableSnapshot()
The snapshot is lazily updated - the first time some branch in the snapshot or this TrieMap are accessed, they are rewritten. This means that the work of rebuilding both the snapshot and this TrieMap is distributed across all the threads doing updates or accesses subsequent to the snapshot creation.
public abstract ImmutableTrieMap<K,V> immutableSnapshot()
The snapshot is lazily updated - the first time some branch of this
TrieMap are accessed, it is rewritten. The work of creating the snapshot
is thus distributed across subsequent updates and accesses on this
TrieMap by all threads. Note that the snapshot itself is never rewritten
unlike when calling mutableSnapshot()
, but the obtained snapshot
cannot be modified.
This method is used by other methods such as `size` and `iterator`.
public final boolean containsKey(Object key)
containsKey
in interface Map<K,V>
public final boolean containsValue(Object value)
containsValue
in interface Map<K,V>
public final V putIfAbsent(K key, V value)
putIfAbsent
in interface ConcurrentMap<K,V>
putIfAbsent
in interface Map<K,V>
public final V compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
public final V computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)
computeIfAbsent
in interface ConcurrentMap<K,V>
computeIfAbsent
in interface Map<K,V>
public final V computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
computeIfPresent
in interface ConcurrentMap<K,V>
computeIfPresent
in interface Map<K,V>
public final V merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)
public final int hashCode()
public final boolean equals(Object o)
Copyright © 2019 OpenDaylight. All rights reserved.