Uses of Class
com.google.gson.internal.LinkedHashTreeMap.Node

Packages that use LinkedHashTreeMap.Node

Package	Description
com.google.gson.internal	Do NOT use any class in this package as they are meant for internal use in Gson.

Uses of LinkedHashTreeMap.Node in com.google.gson.internal

Fields in com.google.gson.internal declared as LinkedHashTreeMap.Node

Modifier and Type	Field	Description
(package private) final LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.header
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.LinkedTreeMapIterator.lastReturned
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.left
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.LinkedTreeMapIterator.next
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.next
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.parent
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.prev
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.right
private LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.AvlBuilder.stack	This stack is a singly linked list, linked by the 'parent' field.
private LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.AvlIterator.stackTop	This stack is a singly linked list, linked by the 'parent' field.
(package private) LinkedHashTreeMap.Node<K,V>[]	LinkedHashTreeMap.table

Methods in com.google.gson.internal that return LinkedHashTreeMap.Node

Modifier and Type	Method	Description
(package private) static <K, V> LinkedHashTreeMap.Node<K,V>[]	LinkedHashTreeMap.doubleCapacity(LinkedHashTreeMap.Node<K,V>[] oldTable)	Returns a new array containing the same nodes as oldTable, but with twice as many trees, each of (approximately) half the previous size.
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.find(K key, boolean create)	Returns the node at or adjacent to the given key, creating it if requested.
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.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.
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.findByObject(Object key)
LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.first()	Returns the first node in this subtree.
LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.Node.last()	Returns the last node in this subtree.
LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.AvlIterator.next()
(package private) final LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.LinkedTreeMapIterator.nextNode()
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.removeInternalByKey(Object key)
(package private) LinkedHashTreeMap.Node<K,V>	LinkedHashTreeMap.AvlBuilder.root()

Methods in com.google.gson.internal with parameters of type LinkedHashTreeMap.Node

Modifier and Type	Method	Description
(package private) void	LinkedHashTreeMap.AvlBuilder.add(LinkedHashTreeMap.Node<K,V> node)
(package private) static <K, V> LinkedHashTreeMap.Node<K,V>[]	LinkedHashTreeMap.doubleCapacity(LinkedHashTreeMap.Node<K,V>[] oldTable)	Returns a new array containing the same nodes as oldTable, but with twice as many trees, each of (approximately) half the previous size.
private void	LinkedHashTreeMap.rebalance(LinkedHashTreeMap.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.
(package private) void	LinkedHashTreeMap.removeInternal(LinkedHashTreeMap.Node<K,V> node, boolean unlink)	Removes node from this tree, rearranging the tree's structure as necessary.
private void	LinkedHashTreeMap.replaceInParent(LinkedHashTreeMap.Node<K,V> node, LinkedHashTreeMap.Node<K,V> replacement)
(package private) void	LinkedHashTreeMap.AvlIterator.reset(LinkedHashTreeMap.Node<K,V> root)
private void	LinkedHashTreeMap.rotateLeft(LinkedHashTreeMap.Node<K,V> root)	Rotates the subtree so that its root's right child is the new root.
private void	LinkedHashTreeMap.rotateRight(LinkedHashTreeMap.Node<K,V> root)	Rotates the subtree so that its root's left child is the new root.

Constructors in com.google.gson.internal with parameters of type LinkedHashTreeMap.Node

Modifier	Constructor	Description
(package private)	Node(LinkedHashTreeMap.Node<K,V> parent, K key, int hash, LinkedHashTreeMap.Node<K,V> next, LinkedHashTreeMap.Node<K,V> prev)	Create a regular entry