public class DoubleKeyMap<K1,K2,V> extends HashMap<K1,Map<K2,V>> implements Map<K1,Map<K2,V>>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
DoubleKeyMap() |
DoubleKeyMap(Class<K1> k1Class,
Class<K2> k2Class,
Class<V> valueClass) |
DoubleKeyMap(DoubleKeyMap<K1,K2,V> other) |
DoubleKeyMap(Map<K1,Map<K2,V>> other) |
| Modifier and Type | Method and Description |
|---|---|
Iterator<V> |
all() |
boolean |
containsKeys(K1 key1,
K2 key2) |
V |
get(K1 key1,
K2 key2) |
Iterator<Map.Entry<K2,V>> |
iterate(K1 key) |
V |
put(K1 key1,
K2 key2,
V value) |
void |
putAll(K1 key1,
Map<K2,V> map) |
V |
removeKey(K1 key1,
K2 key2) |
boolean |
removeValue(K1 key1,
K2 key2,
V value) |
clear, clone, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, forEach, get, getOrDefault, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesequals, hashCode, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuespublic DoubleKeyMap()
public DoubleKeyMap(DoubleKeyMap<K1,K2,V> other)
Copyright © 2019 aQute SARL. All rights reserved.