public class SoftHashMap<K,V> extends AbstractMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_LIMIT |
| Constructor and Description |
|---|
SoftHashMap() |
SoftHashMap(int hardSize) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
Set<Map.Entry<K,V>> |
entrySet() |
V |
get(Object key) |
V |
put(K key,
V value)
Here we put the key, value pair into the HashMap using a SoftValue
object.
|
V |
remove(Object key) |
int |
size() |
clone, containsKey, containsValue, equals, hashCode, isEmpty, keySet, putAll, toString, valuesfinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic static final int DEFAULT_LIMIT
public SoftHashMap()
public SoftHashMap(int hardSize)
Copyright © 2000–2017 BioJava. All rights reserved.