Class LinkedTreeMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

com.google.gson.internal.LinkedTreeMap<K,V>

All Implemented Interfaces:

Serializable, Map<K,V>

public final class LinkedTreeMap<K,V>
extends AbstractMap<K,V>
implements Serializable

A map of comparable keys to values. Unlike TreeMap, this class uses insertion order for iteration order. Comparison order is only used as an optimization for efficient insertion and removal.

This implementation was derived from Android 4.1's TreeMap class.

See Also:

• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class AbstractMap

AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface Map

Map.Entry<K,V>

Constructor Summary

Constructors

Constructor	Description
LinkedTreeMap()	Create a natural order, empty tree map whose keys must be mutually comparable and non-null, and whose values can be null.
LinkedTreeMap(boolean allowNullValues)	Create a natural order, empty tree map whose keys must be mutually comparable and non-null.
LinkedTreeMap(Comparator<? super K> comparator, boolean allowNullValues)	Create a tree map ordered by comparator.

Method Summary

Modifier and Type	Method	Description
void	clear()
boolean	containsKey(Object key)
Set<Map.Entry<K,V>>	entrySet()
V	get(Object key)
Set<K>	keySet()
V	put(K key, V value)
V	remove(Object key)
int	size()

Methods inherited from class AbstractMap

clone, containsValue, equals, hashCode, isEmpty, putAll, toString, values

Methods inherited from class Object

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

Methods inherited from interface Map

compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll

Constructor Details

LinkedTreeMap

public LinkedTreeMap()

Create a natural order, empty tree map whose keys must be mutually comparable and non-null, and whose values can be null.

LinkedTreeMap

public LinkedTreeMap(boolean allowNullValues)

Create a natural order, empty tree map whose keys must be mutually comparable and non-null.

Parameters:

allowNullValues - whether null is allowed as entry value

LinkedTreeMap

public LinkedTreeMap(Comparator<? super K> comparator,
 boolean allowNullValues)

Create a tree map ordered by comparator. This map's keys may only be null if comparator permits.

Parameters:

comparator - the comparator to order elements with, or null to use the natural ordering.

allowNullValues - whether null is allowed as entry value

Method Details

size

public int size()

Specified by:

size in interface Map<K,V>

Overrides:

size in class AbstractMap<K,V>

get

public V get(Object key)

Specified by:

get in interface Map<K,V>

Overrides:

get in class AbstractMap<K,V>

containsKey

public boolean containsKey(Object key)

Specified by:

containsKey in interface Map<K,V>

Overrides:

containsKey in class AbstractMap<K,V>

put

@CanIgnoreReturnValue
public V put(K key,
 V value)

Specified by:

put in interface Map<K,V>

Overrides:

put in class AbstractMap<K,V>

clear

public void clear()

Specified by:

clear in interface Map<K,V>

Overrides:

clear in class AbstractMap<K,V>

remove

public V remove(Object key)

Specified by:

remove in interface Map<K,V>

Overrides:

remove in class AbstractMap<K,V>

entrySet

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

Specified by:

entrySet in interface Map<K,V>

Specified by:

entrySet in class AbstractMap<K,V>

keySet

public Set<K> keySet()

Specified by:

keySet in interface Map<K,V>

Overrides:

keySet in class AbstractMap<K,V>