Package com.google.gson.internal
Class LinkedHashTreeMap.Node<K,V>
java.lang.Object
com.google.gson.internal.LinkedHashTreeMap.Node<K,V>
- All Implemented Interfaces:
Map.Entry<K,
V>
- Enclosing class:
- LinkedHashTreeMap<K,
V>
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) final int
(package private) int
(package private) final K
(package private) LinkedHashTreeMap.Node<K,
V> (package private) LinkedHashTreeMap.Node<K,
V> (package private) LinkedHashTreeMap.Node<K,
V> (package private) LinkedHashTreeMap.Node<K,
V> (package private) LinkedHashTreeMap.Node<K,
V> (package private) V
-
Constructor Summary
ConstructorsConstructorDescriptionNode()
Create the header entryNode
(LinkedHashTreeMap.Node<K, V> parent, K key, int hash, LinkedHashTreeMap.Node<K, V> next, LinkedHashTreeMap.Node<K, V> prev) Create a regular entry -
Method Summary
-
Field Details
-
parent
LinkedHashTreeMap.Node<K,V> parent -
left
LinkedHashTreeMap.Node<K,V> left -
right
LinkedHashTreeMap.Node<K,V> right -
next
LinkedHashTreeMap.Node<K,V> next -
prev
LinkedHashTreeMap.Node<K,V> prev -
key
-
hash
final int hash -
value
V value -
height
int height
-
-
Constructor Details
-
Node
Node()Create the header entry -
Node
Node(LinkedHashTreeMap.Node<K, V> parent, K key, int hash, LinkedHashTreeMap.Node<K, V> next, LinkedHashTreeMap.Node<K, V> prev) Create a regular entry
-
-
Method Details
-
getKey
-
getValue
-
setValue
-
equals
-
hashCode
public int hashCode() -
toString
-
first
Returns the first node in this subtree. -
last
Returns the last node in this subtree.
-