public class PairMap<T,I,V> extends AbstractMap<Pair<T,I>,V> implements Serializable, Cloneable
PairSet instance. It is not as fast as HashMap , but requires much less memory.PairSet,
Serialized FormAbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
PairMap(PairSet<T,I> keys)
Creates an empty map
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
PairMap<T,I,V> |
clone() |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
Set<Map.Entry<Pair<T,I>,V>> |
entrySet() |
V |
get(Object key) |
boolean |
isEmpty() |
Set<Pair<T,I>> |
keySet() |
V |
put(Pair<T,I> key,
V value) |
V |
remove(Object key) |
int |
size() |
Collection<V> |
values() |
equals, hashCode, putAll, toStringpublic PairMap(PairSet<T,I> keys)
keys - PairSet instance internally used to store indices. If
not empty, get(Object) will return null
for each existing pair if we do not also put a value.public void clear()
public boolean containsKey(Object key)
containsKey in interface Map<Pair<T,I>,V>containsKey in class AbstractMap<Pair<T,I>,V>public boolean containsValue(Object value)
containsValue in interface Map<Pair<T,I>,V>containsValue in class AbstractMap<Pair<T,I>,V>public boolean isEmpty()
public int size()
public Collection<V> values()
Copyright © 2016. All rights reserved.