K - Key is composed of data id and distance value.V - Value is the class of the data point.public class TopNTreeMap<K extends KNNKey,V>
extends java.util.TreeMap<K,V>
| Modifier and Type | Field and Description |
|---|---|
int |
n |
| Modifier and Type | Method and Description |
|---|---|
java.util.Comparator<? super K> |
comparator() |
V |
put(K key,
V value) |
ceilingEntry, ceilingKey, clear, clone, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, values