DynamicValueSortedTreeMap.Node

java.lang.Object
- ghidra.generic.util.datastruct.DynamicValueSortedTreeMap.Node

All Implemented Interfaces:

java.util.Map.Entry<K,V>

Enclosing class:

DynamicValueSortedTreeMap<K,V>
```
protected class DynamicValueSortedTreeMap.Node
extends java.lang.Object
implements java.util.Map.Entry<K,V>
```
An entry in the map. Nodes are elements of a binary tree and a doubly-linked list.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`int`	`computeIndex()`	Compute this node's index.
`boolean`	`equals(java.lang.Object obj)`
`K`	`getKey()`
`V`	`getValue()`
`V`	`setValue(V value)`
`java.lang.String`	`toString()`

Methods inherited from class java.lang.Object
clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map.Entry
hashCode

- Method Detail
  - toString
```
public java.lang.String toString()
```
    Overrides:
    
    toString in class java.lang.Object
  - equals
```
public boolean equals(java.lang.Object obj)
```
    Specified by:
    
    equals in interface java.util.Map.Entry<K,V>
    
    Overrides:
    
    equals in class java.lang.Object
  - computeIndex
```
public int computeIndex()
```
    Compute this node's index. This uses the sizeLeft field to compute the index in O(log n) on average.
    
    Returns:
    
    the index
  - getKey
```
public K getKey()
```
    Specified by:
    
    getKey in interface java.util.Map.Entry<K,V>
  - getValue
```
public V getValue()
```
    Specified by:
    
    getValue in interface java.util.Map.Entry<K,V>
  - setValue
```
public V setValue(V value)
```
    Specified by:
    
    setValue in interface java.util.Map.Entry<K,V>