static final class LinkedHashTreeMap.Node<K,V>
extends java.lang.Object
implements java.util.Map.Entry<K,V>
Modifier and Type | Field and Description |
---|---|
(package private) int |
hash |
(package private) int |
height |
(package private) K |
key |
(package private) LinkedHashTreeMap.Node<K,V> |
left |
(package private) LinkedHashTreeMap.Node<K,V> |
next |
(package private) LinkedHashTreeMap.Node<K,V> |
parent |
(package private) LinkedHashTreeMap.Node<K,V> |
prev |
(package private) LinkedHashTreeMap.Node<K,V> |
right |
(package private) V |
value |
Constructor and Description |
---|
Node()
Create the header entry
|
Node(LinkedHashTreeMap.Node<K,V> parent,
K key,
int hash,
LinkedHashTreeMap.Node<K,V> next,
LinkedHashTreeMap.Node<K,V> prev)
Create a regular entry
|
Modifier and Type | Method and Description |
---|---|
boolean |
equals(java.lang.Object o) |
LinkedHashTreeMap.Node<K,V> |
first()
Returns the first node in this subtree.
|
K |
getKey() |
V |
getValue() |
int |
hashCode() |
LinkedHashTreeMap.Node<K,V> |
last()
Returns the last node in this subtree.
|
V |
setValue(V value) |
java.lang.String |
toString() |
LinkedHashTreeMap.Node<K,V> parent
LinkedHashTreeMap.Node<K,V> left
LinkedHashTreeMap.Node<K,V> right
LinkedHashTreeMap.Node<K,V> next
LinkedHashTreeMap.Node<K,V> prev
final K key
final int hash
V value
int height
Node()
Node(LinkedHashTreeMap.Node<K,V> parent, K key, int hash, LinkedHashTreeMap.Node<K,V> next, LinkedHashTreeMap.Node<K,V> prev)
public boolean equals(java.lang.Object o)
public int hashCode()
public java.lang.String toString()
toString
in class java.lang.Object
public LinkedHashTreeMap.Node<K,V> first()
public LinkedHashTreeMap.Node<K,V> last()