Module java.base
Package java.util

# Class TreeMap

=
public class TreeMap<K, V>
extends java.util.AbstractMap<K, V>
implements java.io.Serializable, java.lang.Cloneable, java.util.NavigableMap<K, V>

## Constructors

- =
  public TreeMap()
- =
  public TreeMap(java.util.Comparator<? super K> arg0)
- =
  public TreeMap(java.util.Map<? extends K, ? extends V> arg0)
- =
  public TreeMap(java.util.SortedMap<K, ? extends V> arg0)

## Methods

- =
  public java.util.Map.Entry<K, V> ceilingEntry(K arg0)
- =
  public K ceilingKey(K arg0)
- =
  public void clear()
- =
  public java.lang.Object clone()
- =
  public java.util.Comparator<? super K> comparator()
- =
  public V compute(K arg0, java.util.function.BiFunction<? super K, ? super V, ? extends V> arg1)
- =
  public V computeIfAbsent(K arg0, java.util.function.Function<? super K, ? extends V> arg1)
- =
  public V computeIfPresent(K arg0, java.util.function.BiFunction<? super K, ? super V, ? extends V> arg1)
- =
  public boolean containsKey(java.lang.Object arg0)
- =
  public boolean containsValue(java.lang.Object arg0)
- =
  public java.util.NavigableSet<K> descendingKeySet()
- =
  public java.util.NavigableMap<K, V> descendingMap()
- =
  public java.util.Set<java.util.Map.Entry<K, V>> entrySet()
- =
  public java.util.Map.Entry<K, V> firstEntry()
- =
  public K firstKey()
- =
  public java.util.Map.Entry<K, V> floorEntry(K arg0)
- =
  public K floorKey(K arg0)
- =
  public void forEach(java.util.function.BiConsumer<? super K, ? super V> arg0)
- =
  public V get(java.lang.Object arg0)
- =
  public java.util.SortedMap<K, V> headMap(K arg0)
- =
  public java.util.NavigableMap<K, V> headMap(K arg0, boolean arg1)
- =
  public java.util.Map.Entry<K, V> higherEntry(K arg0)
- =
  public K higherKey(K arg0)
- =
  public java.util.Set<K> keySet()
- =
  public java.util.Map.Entry<K, V> lastEntry()
- =
  public K lastKey()
- =
  public java.util.Map.Entry<K, V> lowerEntry(K arg0)
- =
  public K lowerKey(K arg0)
- =
  public V merge(K arg0, V arg1, java.util.function.BiFunction<? super V, ? super V, ? extends V> arg2)
- =
  public java.util.NavigableSet<K> navigableKeySet()
- =
  public java.util.Map.Entry<K, V> pollFirstEntry()
- =
  public java.util.Map.Entry<K, V> pollLastEntry()
- =
  public V put(K arg0, V arg1)
- =
  public void putAll(java.util.Map<? extends K, ? extends V> arg0)
- =
  public V putFirst(K arg0, V arg1)
- =
  public V putIfAbsent(K arg0, V arg1)
- =
  public V putLast(K arg0, V arg1)
- =
  public V remove(java.lang.Object arg0)
- =
  public V replace(K arg0, V arg1)
- =
  public boolean replace(K arg0, V arg1, V arg2)
- =
  public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V> arg0)
- =
  public int size()
- =
  public java.util.NavigableMap<K, V> subMap(K arg0, boolean arg1, K arg2, boolean arg3)
- =
  public java.util.SortedMap<K, V> subMap(K arg0, K arg1)
- =
  public java.util.SortedMap<K, V> tailMap(K arg0)
- =
  public java.util.NavigableMap<K, V> tailMap(K arg0, boolean arg1)
- =
  public java.util.Collection<V> values()

## Serialized Form

=

### serialVersionUID

=919286545866124006

### Serialized Fields

- =
  java.util.Comparator<? super K> comparator

### Serialization Methods

- =
  private void readObject(java.io.ObjectInputStream arg0) throws java.io.IOException, java.lang.ClassNotFoundException
- =
  private void writeObject(java.io.ObjectOutputStream arg0) throws java.io.IOException

## Summary

No differences.