KEYTYPE - key typeVALUETYPE - value type@NotThreadSafe public class MultiConcurrentHashMapTreeSetBased<KEYTYPE,VALUETYPE extends Comparable<? super VALUETYPE>> extends AbstractMultiConcurrentHashMapSetBased<KEYTYPE,VALUETYPE,ICommonsNavigableSet<VALUETYPE>>
ConcurrentHashMap and
CommonsTreeSet values.null keys are not allowed here!ConcurrentHashMap.KeySetView<K,V>AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
MultiConcurrentHashMapTreeSetBased() |
MultiConcurrentHashMapTreeSetBased(KEYTYPE aKey,
ICommonsNavigableSet<VALUETYPE> aCollection) |
MultiConcurrentHashMapTreeSetBased(KEYTYPE aKey,
VALUETYPE aValue) |
MultiConcurrentHashMapTreeSetBased(Map<? extends KEYTYPE,? extends ICommonsNavigableSet<VALUETYPE>> aCont) |
| Modifier and Type | Method and Description |
|---|---|
protected CommonsTreeSet<VALUETYPE> |
createNewCollection() |
getOrCreategetCloneclear, compute, computeIfAbsent, computeIfPresent, contains, containsKey, containsValue, elements, entrySet, equals, forEach, forEach, forEach, forEachEntry, forEachEntry, forEachKey, forEachKey, forEachValue, forEachValue, get, getOrDefault, hashCode, isEmpty, keys, keySet, keySet, mappingCount, merge, newKeySet, newKeySet, put, putAll, putIfAbsent, reduce, reduceEntries, reduceEntries, reduceEntriesToDouble, reduceEntriesToInt, reduceEntriesToLong, reduceKeys, reduceKeys, reduceKeysToDouble, reduceKeysToInt, reduceKeysToLong, reduceToDouble, reduceToInt, reduceToLong, reduceValues, reduceValues, reduceValuesToDouble, reduceValuesToInt, reduceValuesToLong, remove, remove, replace, replace, replaceAll, search, searchEntries, searchKeys, searchValues, size, toString, valuesclonefinalize, getClass, notify, notifyAll, wait, wait, waitcontainsSingle, forEachSingle, getOrCreate, getTotalValueCount, putAllIn, putSingle, removeSingleaddAll, copyOfEntrySet, copyOfKeySet, copyOfValues, copyOfValues, copyOfValuesMapped, copyOfValuesMapped, findFirstEntry, findFirstKey, findFirstValue, getAsUnmodifiable, getFirstEntry, getFirstKey, getFirstValue, getSortedByKey, getSortedByValue, getSwappedKeyValues, isNotEmpty, putIf, putIfNotNull, removeAll, setAllclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesgetClonepublic MultiConcurrentHashMapTreeSetBased()
public MultiConcurrentHashMapTreeSetBased(@Nonnull KEYTYPE aKey, @Nullable VALUETYPE aValue)
public MultiConcurrentHashMapTreeSetBased(@Nonnull KEYTYPE aKey, @Nonnull ICommonsNavigableSet<VALUETYPE> aCollection)
public MultiConcurrentHashMapTreeSetBased(@Nullable Map<? extends KEYTYPE,? extends ICommonsNavigableSet<VALUETYPE>> aCont)
@Nonnull @ReturnsMutableCopy protected final CommonsTreeSet<VALUETYPE> createNewCollection()
createNewCollection in class AbstractMultiConcurrentHashMap<KEYTYPE,VALUETYPE extends Comparable<? super VALUETYPE>,ICommonsNavigableSet<VALUETYPE extends Comparable<? super VALUETYPE>>>Copyright © 2014–2016 Philip Helger. All rights reserved.