public class MultiTreeMapWeakHashMapBased<KEYTYPE1,KEYTYPE2 extends Comparable<? super KEYTYPE2>,VALUETYPE> extends AbstractMultiTreeMapMapBased<KEYTYPE1,KEYTYPE2,VALUETYPE,ICommonsMap<KEYTYPE2,VALUETYPE>>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
MultiTreeMapWeakHashMapBased() |
MultiTreeMapWeakHashMapBased(Comparator<? super KEYTYPE1> aComparator) |
MultiTreeMapWeakHashMapBased(KEYTYPE1 aKey,
KEYTYPE2 aInnerKey,
VALUETYPE aValue) |
MultiTreeMapWeakHashMapBased(KEYTYPE1 aKey,
Map<? extends KEYTYPE2,? extends VALUETYPE> aValue) |
MultiTreeMapWeakHashMapBased(Map<? extends KEYTYPE1,? extends Map<? extends KEYTYPE2,? extends VALUETYPE>> aCont) |
| Modifier and Type | Method and Description |
|---|---|
protected CommonsWeakHashMap<KEYTYPE2,VALUETYPE> |
createNewInnerMap() |
getOrCreatecreateInstance, getCloneceilingEntry, ceilingKey, clear, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, put, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, valuesequals, hashCode, isEmpty, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsSingle, forEachSingle, getSingle, getTotalValueCount, putAllIn, putSingle, removeSingleaddAll, 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, putAll, putAll, putAllMapped, putAllMapped, putAllMapped, putIf, putIfNotNull, removeAll, removeObject, setAllclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesgetClonegetAsUnmodifiableceilingEntry, ceilingKey, descendingKeySet, descendingMap, firstEntry, floorEntry, floorKey, headMap, headMap, higherEntry, higherKey, lastEntry, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, subMap, subMap, tailMap, tailMapcopyOfEntrySet, copyOfKeySet, copyOfKeySet, getFirstKey, getFirstValue, getLastKey, getLastKey, getLastValue, getLastValuepublic MultiTreeMapWeakHashMapBased()
public MultiTreeMapWeakHashMapBased(@Nullable Comparator<? super KEYTYPE1> aComparator)
public MultiTreeMapWeakHashMapBased(@Nonnull KEYTYPE1 aKey, @Nonnull KEYTYPE2 aInnerKey, @Nullable VALUETYPE aValue)
public MultiTreeMapWeakHashMapBased(@Nullable KEYTYPE1 aKey, @Nullable Map<? extends KEYTYPE2,? extends VALUETYPE> aValue)
@Nonnull @ReturnsMutableCopy protected CommonsWeakHashMap<KEYTYPE2,VALUETYPE> createNewInnerMap()
createNewInnerMap in class AbstractMultiTreeMapMapBased<KEYTYPE1,KEYTYPE2 extends Comparable<? super KEYTYPE2>,VALUETYPE,ICommonsMap<KEYTYPE2 extends Comparable<? super KEYTYPE2>,VALUETYPE>>Copyright © 2014–2017 Philip Helger. All rights reserved.