java.util

Class TreeMap<K,V>

public class TreeMap<K,V> extends AbstractMap<K,V> implements SortedMap<K,V>, Cloneable, Serializable

Constructor Summary
TreeMap()
TreeMap(Comparator<K> c)
<K1 extends K,V1 extends V>TreeMap(Map<K1,V1> m)
<V1 extends V>TreeMap(SortedMap<K,V1> m)
Method Summary
voidclear()
Objectclone()
Comparator<K>comparator()
booleancontainsKey(Object key)
booleancontainsValue(Object value)
Set<Map.Entry<K,V>>entrySet()
KfirstKey()
Vget(K key)
SortedMap<K,V>headMap(K toKey)
Set<K>keySet()
KlastKey()
Vput(K key, V value)
<K1 extends K,V1 extends V> voidputAll(Map<K1,V1> map)
Vremove(Object key)
intsize()
SortedMap<K,V>subMap(K fromKey, K toKey)
SortedMap<K,V>tailMap(K fromKey)
Collection<V>values()

Constructor Detail

TreeMap

public TreeMap()

TreeMap

public TreeMap(Comparator<K> c)

TreeMap

public <K1 extends K,V1 extends V> TreeMap(Map<K1,V1> m)

TreeMap

public <V1 extends V> TreeMap(SortedMap<K,V1> m)

Method Detail

clear

public void clear()

clone

public Object clone()

comparator

public Comparator<K> comparator()

containsKey

public boolean containsKey(Object key)

containsValue

public boolean containsValue(Object value)

entrySet

public Set<Map.Entry<K,V>> entrySet()

firstKey

public K firstKey()

get

public V get(K key)

headMap

public SortedMap<K,V> headMap(K toKey)

keySet

public Set<K> keySet()

lastKey

public K lastKey()

put

public V put(K key, V value)

putAll

public <K1 extends K,V1 extends V> void putAll(Map<K1,V1> map)

remove

public V remove(Object key)

size

public int size()

subMap

public SortedMap<K,V> subMap(K fromKey, K toKey)

tailMap

public SortedMap<K,V> tailMap(K fromKey)

values

public Collection<V> values()