K
- V
- public class LMergeMap<K,V>
extends java.lang.Object
implements java.lang.Iterable<V>
Constructor and Description |
---|
LMergeMap(java.lang.Boolean sorted) |
LMergeMap(java.lang.Boolean sorted,
java.lang.Boolean unique) |
Modifier and Type | Method and Description |
---|---|
void |
addAll(LMergeMap<K,V> in) |
void |
clear() |
boolean |
containsKey(K key) |
boolean |
containsValue(V value) |
java.util.Set<java.util.Map.Entry<K,java.util.ArrayList<V>>> |
entrySet() |
java.util.Map<K,V> |
flatten() |
LMergeMap<V,K> |
flip()
Flips the mergemap so keys become values.
|
java.util.ArrayList<V> |
get(K key) |
int |
hashcode() |
boolean |
isEmpty() |
java.util.Iterator<V> |
iterator() |
java.util.Set<K> |
keySet() |
int |
numVals() |
java.util.ArrayList<java.lang.String> |
print() |
void |
put(K key,
java.util.ArrayList<V> value) |
void |
put(K key,
V value) |
void |
remove(K key) |
int |
size() |
java.util.Collection<java.util.ArrayList<V>> |
values() |
java.util.ArrayList<V> |
valuesFlat() |
public LMergeMap(java.lang.Boolean sorted)
sorted
- Whether to use TreeMap as the container.public LMergeMap(java.lang.Boolean sorted, java.lang.Boolean unique)
sorted
- Whether to use TreeMap as the container.unique
- Whether to check for object uniqueness before adding to the list.public void clear()
public boolean containsKey(K key)
key
- public boolean containsValue(V value)
value
- public int hashcode()
public boolean isEmpty()
public java.util.Set<K> keySet()
public void remove(K key)
key
- public int size()
public int numVals()
public java.util.Collection<java.util.ArrayList<V>> values()
public java.util.ArrayList<V> valuesFlat()
public java.util.ArrayList<java.lang.String> print()