Package ghidra.generic.util.datastruct
Class 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 intcomputeIndex()Compute this node's index.booleanequals(java.lang.Object obj)KgetKey()VgetValue()VsetValue(V value)java.lang.StringtoString()
-
-
-
Method Detail
-
toString
public java.lang.String toString()
- Overrides:
toStringin classjava.lang.Object
-
equals
public boolean equals(java.lang.Object obj)
-
computeIndex
public int computeIndex()
Compute this node's index. This uses thesizeLeftfield to compute the index in O(log n) on average.- Returns:
- the index
-
-