K
- the type of the keys usedV
- the type of the values (elements) usedpublic class MultiTreeMap<K,V> extends Object
Constructor and Description |
---|
MultiTreeMap()
Creates a new instance of this class using the default key comparator.
|
MultiTreeMap(Comparator<? super K> comparator)
Creates a new instance of this class using the specified comparator.
|
public MultiTreeMap()
public MultiTreeMap(Comparator<? super K> comparator)
comparator
- the comparator used to sort the keys in the tree mappublic Map.Entry<K,? extends Collection<V>> ceilingEntry(K key)
public K ceilingKey(K key)
public Comparator<? super K> comparator()
public NavigableSet<K> descendingKeySet()
public Map.Entry<K,? extends Collection<V>> firstEntry()
public Map.Entry<K,? extends Collection<V>> floorEntry(K key)
public Map.Entry<K,? extends Collection<V>> higherEntry(K key)
public Map.Entry<K,? extends Collection<V>> lastEntry()
public Map.Entry<K,? extends Collection<V>> lowerEntry(K key)
public void clear()
public boolean containsKey(K key)
public boolean containsValue(K key, V value)
public boolean containsValue(V value)
public Collection<V> get(K key)
public Collection<? extends Collection<V>> getCollection(K key)
public boolean isEmpty()
public NavigableSet<K> navigableKeySet()
public NavigableMap<K,ArrayList<V>> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
public boolean putAll(K key, Collection<V> values)
public Collection<V> remove(K key)
public int size()
public int totalSize()
public Collection<V> values()
public Iterator<V> valueIterator()
public <T> T[] toArray(T[] array)