Modifier and Type	Class and Description
pack-priv class	LinkedTreeMap.EntrySet
pack-priv class	LinkedTreeMap.KeySet
private abstract class	LinkedTreeMap.LinkedTreeMapIterator<T>
pack-priv static class	LinkedTreeMap.Node<K, V>

Modifier and Type	Field and Description
private final boolean	allowNullValues
private final Comparator<? super K>	comparator
private LinkedTreeMap<K, V>.EntrySet	entrySet
pack-priv final LinkedTreeMap.Node<K, V>	header
private LinkedTreeMap<K, V>.KeySet	keySet Hides java.util.AbstractMap.keySet.
pack-priv int	modCount
private static final Comparator<Comparable<T>>	NATURAL_ORDER
pack-priv LinkedTreeMap.Node<K, V>	root
pack-priv int	size

Access	Constructor and Description
public	LinkedTreeMap() Create a natural order, empty tree map whose keys must be mutually comparable and non-null, and whose values can be `null`.
public	LinkedTreeMap(boolean whether `null` is allowed as entry value allowNullValues) Create a natural order, empty tree map whose keys must be mutually comparable and non-null.
public	LinkedTreeMap(Comparator<? super K> the comparator to order elements with, or `null` to use the natural ordering. comparator, boolean whether `null` is allowed as entry value allowNullValues) Create a tree map ordered by `comparator`.

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractMap.clear. Implements java.util.Map.clear. Removes all of the mappings from this map (optional operation).
public boolean	containsKey(Object key) Overrides java.util.AbstractMap.containsKey. Implements java.util.Map.containsKey. Returns `true` if this map contains a mapping for the specified key.
public Set<Map.Entry<K, V>>	entrySet() Implements abstract java.util.AbstractMap.entrySet. Implements java.util.Map.entrySet. Returns a `Set` view of the mappings contained in this map.
private static boolean	equal(Object a, Object b)
pack-priv LinkedTreeMap.Node<K, V>	find(K key, boolean create) Returns the node at or adjacent to the given key, creating it if requested.
pack-priv LinkedTreeMap.Node<K, V>	findByEntry(Map.Entry<?, ?> entry) Returns this map's entry that has the same key and value as `entry`, or null if this map has no such entry.
pack-priv LinkedTreeMap.Node<K, V>	findByObject(Object key)
public V	get(Object key) Overrides java.util.AbstractMap.get. Implements java.util.Map.get. Returns the value to which the specified key is mapped, or `null` if this map contains no mapping for the key.
public Set<K>	keySet() Overrides java.util.AbstractMap.keySet. Implements java.util.Map.keySet. Returns a `Set` view of the keys contained in this map.
public V	put(K key, V value) Overrides java.util.AbstractMap.put. Implements java.util.Map.put. Associates the specified value with the specified key in this map (optional operation).
private void	readObject(ObjectInputStream in)
private void	rebalance(LinkedTreeMap.Node<K, V> unbalanced, boolean true if the node was unbalanced by an insert; false if it was by a removal. insert) Rebalances the tree by making any AVL rotations necessary between the newly-unbalanced node and the tree's root.
public V	remove(Object key) Overrides java.util.AbstractMap.remove. Implements java.util.Map.remove. Removes the mapping for a key from this map if it is present (optional operation).
pack-priv void	removeInternal(LinkedTreeMap.Node<K, V> node, boolean true to also unlink this node from the iteration linked list. unlink) Removes `node` from this tree, rearranging the tree's structure as necessary.
pack-priv LinkedTreeMap.Node<K, V>	removeInternalByKey(Object key)
private void	replaceInParent(LinkedTreeMap.Node<K, V> node, LinkedTreeMap.Node<K, V> replacement)
private void	rotateLeft(LinkedTreeMap.Node<K, V> root) Rotates the subtree so that its root's right child is the new root.
private void	rotateRight(LinkedTreeMap.Node<K, V> root) Rotates the subtree so that its root's left child is the new root.
public int	size() Overrides java.util.AbstractMap.size. Implements java.util.Map.size. Returns the number of key-value mappings in this map.
private Object	writeReplace() If somebody is unlucky enough to have to serialize one of these, serialize it as a LinkedHashMap so that they won't need Gson on the other side to deserialize it.

Inherited from java.util.AbstractMap:: clone containsValue equals hashCode isEmpty putAll toString values

Field Detail

allowNullValues	back to summary
private final boolean allowNullValues

comparator	back to summary
private final Comparator<? super K> comparator

entrySet	back to summary
private LinkedTreeMap<K, V>.EntrySet entrySet

header	back to summary
pack-priv final LinkedTreeMap.Node<K, V> header

keySet	back to summary
private LinkedTreeMap<K, V>.KeySet keySet Hides java.util.AbstractMap.keySet.

modCount	back to summary
pack-priv int modCount

NATURAL_ORDER	back to summary
private static final Comparator<Comparable<T>> NATURAL_ORDER Annotations @SuppressWarnings:unchecked, rawtypes

root	back to summary
pack-priv LinkedTreeMap.Node<K, V> root

size	back to summary
pack-priv int size

Constructor Detail

LinkedTreeMap back to summary

LinkedTreeMap	back to summary
public LinkedTreeMap() Create a natural order, empty tree map whose keys must be mutually comparable and non-null, and whose values can be `null`. Annotations @SuppressWarnings:unchecked

public LinkedTreeMap()

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

Annotations

@SuppressWarnings:unchecked

LinkedTreeMap back to summary

LinkedTreeMap	back to summary
public LinkedTreeMap(boolean allowNullValues) Create a natural order, empty tree map whose keys must be mutually comparable and non-null. Parameters allowNullValues:boolean whether `null` is allowed as entry value Annotations @SuppressWarnings:unchecked

public LinkedTreeMap(boolean allowNullValues)

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

Parameters

allowNullValues:boolean: whether null is allowed as entry value

Annotations

@SuppressWarnings:unchecked

LinkedTreeMap back to summary

LinkedTreeMap	back to summary
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:Comparator<? super K> the comparator to order elements with, or `null` to use the natural ordering. allowNullValues:boolean whether `null` is allowed as entry value Annotations @SuppressWarnings:unchecked, rawtypes

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:Comparator<? super K>: the comparator to order elements with, or null to use the natural ordering.
allowNullValues:boolean: whether null is allowed as entry value

Annotations

@SuppressWarnings:unchecked, rawtypes

Method Detail

clear	back to summary
public void clear() Overrides java.util.AbstractMap.clear. Implements java.util.Map.clear. Doc from java.util.AbstractMap.clear. Removes all of the mappings from this map (optional operation). The map will be empty after this call returns. Annotations @Override

clear

back to summary

public void clear()

Overrides java.util.AbstractMap.clear.

Implements java.util.Map.clear.

Doc from java.util.AbstractMap.clear.

Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.

Annotations

@Override

containsKey back to summary

containsKey	back to summary
public boolean containsKey(Object key) Overrides java.util.AbstractMap.containsKey. Implements java.util.Map.containsKey. Doc from java.util.AbstractMap.containsKey. Returns `true` if this map contains a mapping for the specified key. More formally, returns `true` if and only if this map contains a mapping for a key `k` such that `Objects.equals(key, k)`. (There can be at most one such mapping.) Annotations @Override

public boolean containsKey(Object key)

Overrides java.util.AbstractMap.containsKey.

Implements java.util.Map.containsKey.

Doc from java.util.AbstractMap.containsKey.

Returns true if this map contains a mapping for the specified key. More formally, returns true if and only if this map contains a mapping for a key k such that Objects.equals(key, k). (There can be at most one such mapping.)

Annotations

@Override

entrySet back to summary

entrySet	back to summary
public Set<Map.Entry<K, V>> entrySet() Implements abstract java.util.AbstractMap.entrySet. Implements java.util.Map.entrySet. Doc from java.util.Map.entrySet. Returns a `Set` view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own `remove` operation, or through the `setValue` operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the `Iterator.remove`, `Set.remove`, `removeAll`, `retainAll` and `clear` operations. It does not support the `add` or `addAll` operations. Annotations @Override

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

Implements abstract java.util.AbstractMap.entrySet.

Implements java.util.Map.entrySet.

Doc from java.util.Map.entrySet.

Returns a Set view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation, or through the setValue operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.

Annotations

@Override

equal	back to summary
private static boolean equal(Object a, Object b)

find back to summary

find	back to summary
pack-priv LinkedTreeMap.Node<K, V> find(K key, boolean create) Returns the node at or adjacent to the given key, creating it if requested. Exceptions ClassCastException: if `key` and the tree's keys aren't mutually comparable.

pack-priv LinkedTreeMap.Node<K, V> find(K key, boolean create)

Returns the node at or adjacent to the given key, creating it if requested.

Exceptions

ClassCastException:: if key and the tree's keys aren't mutually comparable.

findByEntry back to summary

findByEntry	back to summary
pack-priv LinkedTreeMap.Node<K, V> findByEntry(Map.Entry<?, ?> entry) Returns this map's entry that has the same key and value as `entry`, or null if this map has no such entry. This method uses the comparator for key equality rather than `equals`. If this map's comparator isn't consistent with equals (such as `String.CASE_INSENSITIVE_ORDER`), then `remove()` and `contains()` will violate the collections API.

pack-priv LinkedTreeMap.Node<K, V> findByEntry(Map.Entry<?, ?> entry)

Returns this map's entry that has the same key and value as entry, or null if this map has no such entry.

This method uses the comparator for key equality rather than equals. If this map's comparator isn't consistent with equals (such as String.CASE_INSENSITIVE_ORDER), then remove() and contains() will violate the collections API.

findByObject	back to summary
pack-priv LinkedTreeMap.Node<K, V> findByObject(Object key) Annotations @SuppressWarnings:unchecked

get back to summary

get	back to summary
public V get(Object key) Overrides java.util.AbstractMap.get. Implements java.util.Map.get. Doc from java.util.AbstractMap.get. Returns the value to which the specified key is mapped, or `null` if this map contains no mapping for the key. More formally, if this map contains a mapping from a key `k` to a value `v` such that `Objects.equals(key, k)`, then this method returns `v`; otherwise it returns `null`. (There can be at most one such mapping.) If this map permits null values, then a return value of `null` does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to `null`. The `containsKey` operation may be used to distinguish these two cases. Annotations @Override

public V get(Object key)

Overrides java.util.AbstractMap.get.

Implements java.util.Map.get.

Doc from java.util.AbstractMap.get.

Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.

More formally, if this map contains a mapping from a key k to a value v such that Objects.equals(key, k), then this method returns v; otherwise it returns null. (There can be at most one such mapping.)

If this map permits null values, then a return value of null does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.

Annotations

@Override

keySet back to summary

keySet	back to summary
public Set<K> keySet() Overrides java.util.AbstractMap.keySet. Implements java.util.Map.keySet. Doc from java.util.AbstractMap.keySet. Returns a `Set` view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own `remove` operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the `Iterator.remove`, `Set.remove`, `removeAll`, `retainAll`, and `clear` operations. It does not support the `add` or `addAll` operations. Annotations @Override

public Set<K> keySet()

Overrides java.util.AbstractMap.keySet.

Implements java.util.Map.keySet.

Doc from java.util.AbstractMap.keySet.

Returns a Set view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.

Annotations

@Override

put back to summary

put	back to summary
public V put(K key, V value) Overrides java.util.AbstractMap.put. Implements java.util.Map.put. Doc from java.util.AbstractMap.put. Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A map `m` is said to contain a mapping for a key `k` if and only if `m.containsKey(k)` would return `true`.) Annotations @CanIgnoreReturnValue @Override

public V put(K key, V value)

Overrides java.util.AbstractMap.put.

Implements java.util.Map.put.

Doc from java.util.AbstractMap.put.

Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A map m is said to contain a mapping for a key k if and only if m.containsKey(k) would return true.)

Annotations

@CanIgnoreReturnValue
@Override

readObject	back to summary
private void readObject(ObjectInputStream in) throws IOException

rebalance	back to summary
private void rebalance(LinkedTreeMap.Node<K, V> unbalanced, boolean insert) Rebalances the tree by making any AVL rotations necessary between the newly-unbalanced node and the tree's root. Parameters insert:boolean true if the node was unbalanced by an insert; false if it was by a removal.

rebalance

back to summary

private void rebalance(LinkedTreeMap.Node<K, V> unbalanced, boolean insert)

Rebalances the tree by making any AVL rotations necessary between the newly-unbalanced node and the tree's root.

Parameters

insert:boolean: true if the node was unbalanced by an insert; false if it was by a removal.

remove back to summary

remove	back to summary
public V remove(Object key) Overrides java.util.AbstractMap.remove. Implements java.util.Map.remove. Doc from java.util.AbstractMap.remove. Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from key `k` to value `v` such that `Objects.equals(key, k)`, that mapping is removed. (The map can contain at most one such mapping.) Returns the value to which this map previously associated the key, or `null` if the map contained no mapping for the key. If this map permits null values, then a return value of `null` does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to `null`. The map will not contain a mapping for the specified key once the call returns. Annotations @Override

public V remove(Object key)

Overrides java.util.AbstractMap.remove.

Implements java.util.Map.remove.

Doc from java.util.AbstractMap.remove.

Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from key k to value v such that Objects.equals(key, k), that mapping is removed. (The map can contain at most one such mapping.)

Returns the value to which this map previously associated the key, or null if the map contained no mapping for the key.

If this map permits null values, then a return value of null does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to null.

The map will not contain a mapping for the specified key once the call returns.

Annotations

@Override

removeInternal back to summary

removeInternal	back to summary
pack-priv void removeInternal(LinkedTreeMap.Node<K, V> node, boolean unlink) Removes `node` from this tree, rearranging the tree's structure as necessary. Parameters unlink:boolean true to also unlink this node from the iteration linked list.

pack-priv void removeInternal(LinkedTreeMap.Node<K, V> node, boolean unlink)

Removes node from this tree, rearranging the tree's structure as necessary.

Parameters

unlink:boolean: true to also unlink this node from the iteration linked list.

removeInternalByKey	back to summary
pack-priv LinkedTreeMap.Node<K, V> removeInternalByKey(Object key)

replaceInParent	back to summary
private void replaceInParent(LinkedTreeMap.Node<K, V> node, LinkedTreeMap.Node<K, V> replacement) Annotations @SuppressWarnings:ReferenceEquality

rotateLeft	back to summary
private void rotateLeft(LinkedTreeMap.Node<K, V> root) Rotates the subtree so that its root's right child is the new root.

rotateRight	back to summary
private void rotateRight(LinkedTreeMap.Node<K, V> root) Rotates the subtree so that its root's left child is the new root.

size back to summary

size	back to summary
public int size() Overrides java.util.AbstractMap.size. Implements java.util.Map.size. Doc from java.util.AbstractMap.size. Returns the number of key-value mappings in this map. If the map contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`. Annotations @Override

public int size()

Overrides java.util.AbstractMap.size.

Implements java.util.Map.size.

Doc from java.util.AbstractMap.size.

Returns the number of key-value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Annotations

@Override

writeReplace	back to summary
private Object writeReplace() throws ObjectStreamException If somebody is unlucky enough to have to serialize one of these, serialize it as a LinkedHashMap so that they won't need Gson on the other side to deserialize it. Using serialization defeats our DoS defence, so most apps shouldn't use it.

com.google.gson.internal back to summary

pack-priv Class LinkedTreeMap.EntrySet

Class Inheritance

extends AbstractSet<Map.Entry<K, V>>

java.lang.Object
java.util.AbstractCollection
java.util.AbstractSet
com.google.gson.internal.LinkedTreeMap.EntrySet

Constructor Summary

Access	Constructor and Description
pack-priv	EntrySet()

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Set.clear, java.util.Collection.clear. Removes all of the elements from this set (optional operation).
public boolean	contains(Object o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Returns `true` if this set contains the specified element.
public Iterator<Map.Entry<K, V>>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.
public boolean	remove(Object o) Overrides java.util.AbstractCollection.remove. Implements java.util.Set.remove, java.util.Collection.remove. Removes the specified element from this set if it is present (optional operation).
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Returns the number of elements in this set (its cardinality).

Inherited from java.util.AbstractSet:: equals hashCode removeAll

Constructor Detail

EntrySet	back to summary
pack-priv EntrySet()

Method Detail

clear	back to summary
public void clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Set.clear, java.util.Collection.clear. Doc from java.util.Set.clear. Removes all of the elements from this set (optional operation). The set will be empty after this call returns. Annotations @Override

clear

back to summary

public void clear()

Overrides java.util.AbstractCollection.clear.

Implements java.util.Set.clear, java.util.Collection.clear.

Doc from java.util.Set.clear.

Removes all of the elements from this set (optional operation). The set will be empty after this call returns.

Annotations

@Override

contains back to summary

contains	back to summary
public boolean contains(Object o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Doc from java.util.Set.contains. Returns `true` if this set contains the specified element. More formally, returns `true` if and only if this set contains an element `e` such that `Objects.equals(o, e)`. Annotations @Override

public boolean contains(Object o)

Overrides java.util.AbstractCollection.contains.

Implements java.util.Set.contains, java.util.Collection.contains.

Doc from java.util.Set.contains.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).

Annotations

@Override

iterator	back to summary
public Iterator<Map.Entry<K, V>> iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Doc from java.util.Set.iterator. Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee). Annotations @Override

iterator

back to summary

public Iterator<Map.Entry<K, V>> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

Annotations

@Override

remove back to summary

remove	back to summary
public boolean remove(Object o) Overrides java.util.AbstractCollection.remove. Implements java.util.Set.remove, java.util.Collection.remove. Doc from java.util.Set.remove. Removes the specified element from this set if it is present (optional operation). More formally, removes an element `e` such that `Objects.equals(o, e)`, if this set contains such an element. Returns `true` if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.) Annotations @Override

public boolean remove(Object o)

Overrides java.util.AbstractCollection.remove.

Implements java.util.Set.remove, java.util.Collection.remove.

Doc from java.util.Set.remove.

Removes the specified element from this set if it is present (optional operation). More formally, removes an element e such that Objects.equals(o, e), if this set contains such an element. Returns true if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)

Annotations

@Override

size back to summary

size	back to summary
public int size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Doc from java.util.Set.size. Returns the number of elements in this set (its cardinality). If this set contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`. Annotations @Override

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Set.size, java.util.Collection.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Annotations

@Override

com.google.gson.internal back to summary

pack-priv final Class LinkedTreeMap.KeySet

Class Inheritance

extends AbstractSet<K>

java.lang.Object
java.util.AbstractCollection
java.util.AbstractSet
com.google.gson.internal.LinkedTreeMap.KeySet

Constructor Summary

Access	Constructor and Description
pack-priv	KeySet()

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Set.clear, java.util.Collection.clear. Removes all of the elements from this set (optional operation).
public boolean	contains(Object o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Returns `true` if this set contains the specified element.
public Iterator<K>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.
public boolean	remove(Object key) Overrides java.util.AbstractCollection.remove. Implements java.util.Set.remove, java.util.Collection.remove. Removes the specified element from this set if it is present (optional operation).
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Returns the number of elements in this set (its cardinality).

Inherited from java.util.AbstractSet:: equals hashCode removeAll

Constructor Detail

KeySet	back to summary
pack-priv KeySet()

Method Detail

clear	back to summary
public void clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Set.clear, java.util.Collection.clear. Doc from java.util.Set.clear. Removes all of the elements from this set (optional operation). The set will be empty after this call returns. Annotations @Override

clear

back to summary

public void clear()

Overrides java.util.AbstractCollection.clear.

Implements java.util.Set.clear, java.util.Collection.clear.

Doc from java.util.Set.clear.

Removes all of the elements from this set (optional operation). The set will be empty after this call returns.

Annotations

@Override

contains back to summary

contains	back to summary
public boolean contains(Object o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Doc from java.util.Set.contains. Returns `true` if this set contains the specified element. More formally, returns `true` if and only if this set contains an element `e` such that `Objects.equals(o, e)`. Annotations @Override

public boolean contains(Object o)

Overrides java.util.AbstractCollection.contains.

Implements java.util.Set.contains, java.util.Collection.contains.

Doc from java.util.Set.contains.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).

Annotations

@Override

iterator	back to summary
public Iterator<K> iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Doc from java.util.Set.iterator. Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee). Annotations @Override

iterator

back to summary

public Iterator<K> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

Annotations

@Override

remove back to summary

public boolean remove(Object key)

Overrides java.util.AbstractCollection.remove.

Implements java.util.Set.remove, java.util.Collection.remove.

Doc from java.util.Set.remove.

Annotations

@Override

size back to summary

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Set.size, java.util.Collection.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Annotations

@Override

com.google.gson.internal back to summary

private abstract Class LinkedTreeMap.LinkedTreeMapIterator<T>

Class Inheritance

extends Object
implements Iterator<T>

java.lang.Object
com.google.gson.internal.LinkedTreeMap.LinkedTreeMapIterator

All Implemented Interfaces

java.util.Iterator

Field Summary

Modifier and Type	Field and Description
pack-priv int	expectedModCount
pack-priv LinkedTreeMap.Node<K, V>	lastReturned
pack-priv LinkedTreeMap.Node<K, V>	next

Constructor Summary

Access	Constructor and Description
pack-priv	LinkedTreeMapIterator()

Method Summary

Modifier and Type	Method and Description
public final boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
pack-priv final LinkedTreeMap.Node<K, V>	nextNode()
public final void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

expectedModCount	back to summary
pack-priv int expectedModCount

lastReturned	back to summary
pack-priv LinkedTreeMap.Node<K, V> lastReturned

next	back to summary
pack-priv LinkedTreeMap.Node<K, V> next

Constructor Detail

LinkedTreeMapIterator	back to summary
pack-priv LinkedTreeMapIterator()

Method Detail

hasNext back to summary

public final boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Annotations

@Override
@SuppressWarnings:ReferenceEquality

nextNode	back to summary
pack-priv final LinkedTreeMap.Node<K, V> nextNode() Annotations @SuppressWarnings:ReferenceEquality

remove back to summary

public final void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

Annotations

@Override

com.google.gson.internal back to summary

pack-priv final Class LinkedTreeMap.Node<K, V>

Class Inheritance

extends Object
implements Map.Entry<K, V>

java.lang.Object
com.google.gson.internal.LinkedTreeMap.Node

All Implemented Interfaces

java.util.Map.Entry

Field Summary

Modifier and Type	Field and Description
pack-priv final boolean	allowNullValue
pack-priv int	height
pack-priv final K	key
pack-priv LinkedTreeMap.Node<K, V>	left
pack-priv LinkedTreeMap.Node<K, V>	next
pack-priv LinkedTreeMap.Node<K, V>	parent
pack-priv LinkedTreeMap.Node<K, V>	prev
pack-priv LinkedTreeMap.Node<K, V>	right
pack-priv V	value

Constructor Summary

Access	Constructor and Description
pack-priv	Node(boolean allowNullValue) Create the header entry
pack-priv	Node(boolean allowNullValue, LinkedTreeMap.Node<K, V> parent, K key, LinkedTreeMap.Node<K, V> next, LinkedTreeMap.Node<K, V> prev) Create a regular entry

Method Summary

Modifier and Type	Method and Description
public boolean	equals(Object o) Overrides java.lang.Object.equals. Implements java.util.Map.Entry.equals. Compares the specified object with this entry for equality.
public LinkedTreeMap.Node<K, V>	first() Returns the first node in this subtree.
public K	getKey() Implements java.util.Map.Entry.getKey. Returns the key corresponding to this entry.
public V	getValue() Implements java.util.Map.Entry.getValue. Returns the value corresponding to this entry.
public int	hashCode() Overrides java.lang.Object.hashCode. Implements java.util.Map.Entry.hashCode. Returns the hash code value for this map entry.
public LinkedTreeMap.Node<K, V>	last() Returns the last node in this subtree.
public V	setValue(V value) Implements java.util.Map.Entry.setValue. Replaces the value corresponding to this entry with the specified value (optional operation).
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll wait wait wait

Field Detail

allowNullValue	back to summary
pack-priv final boolean allowNullValue

height	back to summary
pack-priv int height

key	back to summary
pack-priv final K key

left	back to summary
pack-priv LinkedTreeMap.Node<K, V> left

next	back to summary
pack-priv LinkedTreeMap.Node<K, V> next

parent	back to summary
pack-priv LinkedTreeMap.Node<K, V> parent

prev	back to summary
pack-priv LinkedTreeMap.Node<K, V> prev

right	back to summary
pack-priv LinkedTreeMap.Node<K, V> right

value	back to summary
pack-priv V value

Constructor Detail

Node	back to summary
pack-priv Node(boolean allowNullValue) Create the header entry

Node	back to summary
pack-priv Node(boolean allowNullValue, LinkedTreeMap.Node<K, V> parent, K key, LinkedTreeMap.Node<K, V> next, LinkedTreeMap.Node<K, V> prev) Create a regular entry

Method Detail

equals back to summary

public boolean equals(Object o)

Overrides java.lang.Object.equals.

Implements java.util.Map.Entry.equals.

Doc from java.util.Map.Entry.equals.

Compares the specified object with this entry for equality. Returns true if the given object is also a map entry and the two entries represent the same mapping. More formally, two entries e1 and e2 represent the same mapping if

    (e1.getKey()==null ?
     e2.getKey()==null : e1.getKey().equals(e2.getKey()))  &&
    (e1.getValue()==null ?
     e2.getValue()==null : e1.getValue().equals(e2.getValue()))

This ensures that the equals method works properly across different implementations of the Map.Entry interface.

Annotations

@Override

first	back to summary
public LinkedTreeMap.Node<K, V> first() Returns the first node in this subtree.

getKey

back to summary

public K getKey()

Implements java.util.Map.Entry.getKey.

Doc from java.util.Map.Entry.getKey.

Returns the key corresponding to this entry.

Annotations

@Override

getValue back to summary

public V getValue()

Implements java.util.Map.Entry.getValue.

Doc from java.util.Map.Entry.getValue.

Returns the value corresponding to this entry. If the mapping has been removed from the backing map (by the iterator's remove operation), the results of this call are undefined.

Annotations

@Override

hashCode back to summary

public int hashCode()

Overrides java.lang.Object.hashCode.

Implements java.util.Map.Entry.hashCode.

Doc from java.util.Map.Entry.hashCode.

Returns the hash code value for this map entry. The hash code of a map entry e is defined to be:

    (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
    (e.getValue()==null ? 0 : e.getValue().hashCode())

This ensures that e1.equals(e2) implies that e1.hashCode()==e2.hashCode() for any two Entries e1 and e2, as required by the general contract of Object.hashCode.

Annotations

@Override

last	back to summary
public LinkedTreeMap.Node<K, V> last() Returns the last node in this subtree.

setValue back to summary

public V setValue(V value)

Implements java.util.Map.Entry.setValue.

Doc from java.util.Map.Entry.setValue.

Replaces the value corresponding to this entry with the specified value (optional operation). (Writes through to the map.) The behavior of this call is undefined if the mapping has already been removed from the map (by the iterator's remove operation).

Annotations

@Override

toString back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Annotations

@Override

public final Class LinkedTreeMap<K, V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class LinkedTreeMap.EntrySet

Constructor Summary

Method Summary

Constructor Detail

Method Detail

pack-priv final Class LinkedTreeMap.KeySet

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private abstract Class LinkedTreeMap.LinkedTreeMapIterator<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv final Class LinkedTreeMap.Node<K, V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail