WeakValueTreeMap

java.lang.Object
- ghidra.util.datastruct.AbstractWeakValueMap<K,V>
- - ghidra.util.datastruct.AbstractWeakValueNavigableMap<K,V>
  - - ghidra.util.datastruct.WeakValueTreeMap<K,V>

All Implemented Interfaces:

java.util.Map<K,V>, java.util.NavigableMap<K,V>, java.util.SortedMap<K,V>
```
public class WeakValueTreeMap<K,V>
extends AbstractWeakValueNavigableMap<K,V>
```
Class to provide a tree map with weak values.

Nested Class Summary
- Nested classes/interfaces inherited from class ghidra.util.datastruct.AbstractWeakValueNavigableMap
  AbstractWeakValueNavigableMap.NavigableView<K,V>
- Nested classes/interfaces inherited from class ghidra.util.datastruct.AbstractWeakValueMap
  AbstractWeakValueMap.GeneratedEntry, AbstractWeakValueMap.WeakValueRef<K,V>
- Nested classes/interfaces inherited from interface java.util.Map
  java.util.Map.Entry<K extends java.lang.Object,V extends java.lang.Object>

Field Summary

Fields
Modifier and Type Field Description

protected java.util.NavigableMap<K,AbstractWeakValueMap.WeakValueRef<K,V>> refMap
- Fields inherited from class ghidra.util.datastruct.AbstractWeakValueMap
  refQueue

Constructor Summary

Constructors
Constructor	Description
`WeakValueTreeMap()`	Constructs a new weak map
`WeakValueTreeMap(java.util.Comparator<K> comparator)`	Constructs a new weak map with keys ordered according to the given comparator

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`protected java.util.NavigableMap<K,AbstractWeakValueMap.WeakValueRef<K,V>>`	`getRefMap()`	Returns the backing map

Methods inherited from class ghidra.util.datastruct.AbstractWeakValueNavigableMap
ceilingEntry, ceilingKey, comparator, descendingKeySet, descendingMap, firstEntry, firstKey, floorEntry, floorKey, generateEntry, headMap, headMap, higherEntry, higherKey, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, subMap, subMap, tailMap, tailMap

Methods inherited from class ghidra.util.datastruct.AbstractWeakValueMap
clear, containsKey, containsValue, entrySet, get, isEmpty, keySet, processQueue, put, putAll, remove, size, values

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

Methods inherited from interface java.util.Map
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size

Methods inherited from interface java.util.SortedMap
entrySet, keySet, values

- Field Detail
  - refMap
```
protected final java.util.NavigableMap<K,AbstractWeakValueMap.WeakValueRef<K,V>> refMap
```
- Constructor Detail
  - WeakValueTreeMap
```
public WeakValueTreeMap()
```
    Constructs a new weak map
  - WeakValueTreeMap
```
public WeakValueTreeMap(java.util.Comparator<K> comparator)
```
    Constructs a new weak map with keys ordered according to the given comparator
    
    Parameters:
    
    comparator - the comparator, or null for the natural ordering
- Method Detail
  - getRefMap
```
protected java.util.NavigableMap<K,AbstractWeakValueMap.WeakValueRef<K,V>> getRefMap()
```
    Description copied from class: AbstractWeakValueMap
    
    Returns the backing map
    
    Specified by:
    
    getRefMap in class AbstractWeakValueNavigableMap<K,V>
    
    Returns:
    
    the map