Uses of Class
com.google.gson.internal.LinkedTreeMap.Node
Packages that use LinkedTreeMap.Node
Package
Description
Do NOT use any class in this package as they are meant for internal use in Gson.
-
Uses of LinkedTreeMap.Node in com.google.gson.internal
Fields in com.google.gson.internal declared as LinkedTreeMap.NodeModifier and TypeFieldDescription(package private) final LinkedTreeMap.Node<K,
V> LinkedTreeMap.header
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.LinkedTreeMapIterator.lastReturned
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.Node.left
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.LinkedTreeMapIterator.next
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.Node.next
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.Node.parent
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.Node.prev
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.Node.right
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.root
Methods in com.google.gson.internal that return LinkedTreeMap.NodeModifier and TypeMethodDescription(package private) LinkedTreeMap.Node<K,
V> Returns the node at or adjacent to the given key, creating it if requested.(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.findByEntry
(Map.Entry<?, ?> entry) Returns this map's entry that has the same key and value asentry
, or null if this map has no such entry.(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.findByObject
(Object key) LinkedTreeMap.Node.first()
Returns the first node in this subtree.LinkedTreeMap.Node.last()
Returns the last node in this subtree.(package private) final LinkedTreeMap.Node<K,
V> LinkedTreeMap.LinkedTreeMapIterator.nextNode()
(package private) LinkedTreeMap.Node<K,
V> LinkedTreeMap.removeInternalByKey
(Object key) Methods in com.google.gson.internal with parameters of type LinkedTreeMap.NodeModifier and TypeMethodDescriptionprivate void
LinkedTreeMap.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.(package private) void
LinkedTreeMap.removeInternal
(LinkedTreeMap.Node<K, V> node, boolean unlink) Removesnode
from this tree, rearranging the tree's structure as necessary.private void
LinkedTreeMap.replaceInParent
(LinkedTreeMap.Node<K, V> node, LinkedTreeMap.Node<K, V> replacement) private void
LinkedTreeMap.rotateLeft
(LinkedTreeMap.Node<K, V> root) Rotates the subtree so that its root's right child is the new root.private void
LinkedTreeMap.rotateRight
(LinkedTreeMap.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 LinkedTreeMap.NodeModifierConstructorDescription(package private)
Node
(boolean allowNullValue, LinkedTreeMap.Node<K, V> parent, K key, LinkedTreeMap.Node<K, V> next, LinkedTreeMap.Node<K, V> prev) Create a regular entry