public class CollectionSortedMap<K,V> extends TreeMap<K,Collection<V>>
The maintained index must only contain values implementing the
Collection interface. The data structure looks like this:
{key: [value, value, ...], key: [value, ...]}
Empty entries are removed by default.
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>
Modifier and Type | Field and Description |
---|---|
protected boolean |
drop_empty |
Constructor and Description |
---|
CollectionSortedMap() |
CollectionSortedMap(Comparator<K> c) |
Modifier and Type | Method and Description |
---|---|
void |
add(K key,
V value) |
protected Collection<V> |
createCollection() |
void |
move(V value,
K old_key,
K new_key) |
boolean |
remove(Object key,
Object value) |
ceilingEntry, 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, values
equals, hashCode, isEmpty, toString
finalize, getClass, notify, notifyAll, wait, wait, wait
compute, computeIfAbsent, computeIfPresent, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent
public CollectionSortedMap()
public CollectionSortedMap(Comparator<K> c)