public abstract class AbstractNumericValueMap<K,N extends Number> extends LinkedHashMap<K,N>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
AbstractNumericValueMap() |
AbstractNumericValueMap(int initialCapacity) |
| Modifier and Type | Method and Description |
|---|---|
N |
addTo(K key,
N value) |
void |
clear() |
boolean |
containsKey(K key) |
N |
get(K key) |
K |
getMax() |
N |
getMaxValue() |
K |
getMin() |
N |
getMinValue() |
protected abstract N |
getZero() |
boolean |
isEmpty() |
Set<K> |
keySet() |
N |
put(K key,
N value) |
void |
putAll(Map<? extends K,? extends N> m) |
N |
remove(K key) |
N |
reset(K key) |
N |
safeGet(K key) |
int |
size() |
List<K> |
sort() |
List<K> |
sort(boolean descending) |
void |
writeTo(PrintStream out) |
clear, containsValue, get, removeEldestEntryclone, containsKey, entrySet, isEmpty, keySet, put, putAll, remove, size, valuesequals, hashCode, toStringpublic AbstractNumericValueMap()
public AbstractNumericValueMap(int initialCapacity)
protected abstract N getZero()
public K getMax()
public K getMin()
public N getMaxValue()
public N getMinValue()
public void writeTo(PrintStream out)
public N get(K key)
public void clear()
public boolean containsKey(K key)
public boolean isEmpty()
public Set<K> keySet()
public N put(K key,
N value)
public void putAll(Map<? extends K,? extends N> m)
public N remove(K key)
public int size()
Copyright © 2011–2017 University of Toronto, Computational Biology Lab. All rights reserved.