org.opendaylight.yangtools.triemap

Class MutableTrieMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

org.opendaylight.yangtools.triemap.TrieMap<K,V>

org.opendaylight.yangtools.triemap.MutableTrieMap<K,V>

Type Parameters:

K - the type of keys maintained by this map

V - the type of mapped values

All Implemented Interfaces:

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

@Beta
public final class MutableTrieMap<K,V>
extends TrieMap<K,V>

A mutable TrieMap.

Author:

Robert Varga

See Also:

Serialized Form

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>

Method Summary

Modifier and Type	Method and Description
void	clear()
ImmutableTrieMap<K,V>	immutableSnapshot() Returns a read-only snapshot of this TrieMap.
MutableTrieMap<K,V>	mutableSnapshot() Returns a snapshot of this TrieMap.
V	put(K key, V value)
V	putIfAbsent(K key, V value)
V	remove(Object key)
boolean	remove(Object key, Object value)
V	replace(K key, V value)
boolean	replace(K key, V oldValue, V newValue)
int	size()

Methods inherited from class org.opendaylight.yangtools.triemap.TrieMap

containsKey, containsValue, create, entrySet, get, keySet

Methods inherited from class java.util.AbstractMap

clone, equals, hashCode, isEmpty, 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

equals, hashCode, isEmpty, putAll, values

Method Detail

clear

public void clear()

Specified by:

clear in interface Map<K,V>

Specified by:

clear in class TrieMap<K,V>

put

public V put(K key,
             V value)

Specified by:

put in interface Map<K,V>

Specified by:

put in class TrieMap<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>

Specified by:

putIfAbsent in class TrieMap<K,V>

remove

public V remove(Object key)

Specified by:

remove in interface Map<K,V>

Specified by:

remove in class TrieMap<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>

Specified by:

remove in class TrieMap<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>

Specified by:

replace in class TrieMap<K,V>

replace

public V replace(K key,
                 V value)

Specified by:

replace in interface ConcurrentMap<K,V>

Specified by:

replace in interface Map<K,V>

Specified by:

replace in class TrieMap<K,V>

size

public int size()

Specified by:

size in interface Map<K,V>

Specified by:

size in class TrieMap<K,V>

immutableSnapshot

public ImmutableTrieMap<K,V> immutableSnapshot()

Description copied from class: TrieMap

Returns a read-only snapshot of this TrieMap. This operation is lock-free and linearizable.

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 the `snapshot` method, but the obtained snapshot cannot be modified.

This method is used by other methods such as `size` and `iterator`.

Specified by:

immutableSnapshot in class TrieMap<K,V>

mutableSnapshot

public MutableTrieMap<K,V> mutableSnapshot()

Description copied from class: TrieMap

Returns a snapshot of this TrieMap. This operation is lock-free and linearizable.

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.

Specified by:

mutableSnapshot in class TrieMap<K,V>