K - Key typeV - Value typepublic class SoftHashMap<K,V> extends AbstractSoftMap<K,V>
HashMap implementation based on
http://www.javaspecialists.eu/archive/Issue015.htmlentrySet implementation is from
org.hypergraphdb.utilSoftHashMap is NOT serializable!AbstractSoftMap.SoftValue<K,V>AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>m_aSrcMap| Constructor and Description |
|---|
SoftHashMap() |
| Modifier and Type | Method and Description |
|---|---|
SoftHashMap<K,V> |
getClone() |
clear, entrySet, equals, get, hashCode, onEntryRemoved, put, remove, sizeclone, containsKey, containsValue, isEmpty, keySet, putAll, toString, valuesfinalize, getClass, notify, notifyAll, wait, wait, waitaddAll, containsAnyEntry, containsAnyKey, containsAnyValue, copyOfEntrySet, copyOfKeySet, copyOfKeySet, copyOfValues, copyOfValues, copyOfValuesMapped, copyOfValuesMapped, createInstance, findFirstEntry, findFirstKey, findFirstValue, forEach, forEachKey, forEachKey, forEachValue, forEachValue, getAsUnmodifiable, getFirstEntry, getFirstEntry, getFirstKey, getFirstKey, getFirstValue, getFirstValue, getSortedByKey, getSortedByValue, getSwappedKeyValues, isNotEmpty, put, putAll, putAll, putAllMapped, putAllMapped, putAllMapped, putIf, putIfNotNull, removeAll, removeIf, removeIfKey, removeIfValue, removeObject, setAllcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, forEach, getOrDefault, isEmpty, keySet, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll, values@Nonnull @ReturnsMutableCopy public SoftHashMap<K,V> getClone()
Copyright © 2014–2019 Philip Helger. All rights reserved.