TreeMap.this

Constructs a new, empty tree map, using the natural ordering of its keys. All keys inserted into the map must implement the {@link Comparable} interface. Furthermore, all such keys must be <em>mutually comparable</em>: {@code k1.compareTo(k2)} must not throw a {@code ClassCastException} for any keys {@code k1} and {@code k2} in the map. If the user attempts to put a key into the map that violates this constraint (for example, the user attempts to put a string key into a map whose keys are integers), the {@code put(Object key, Object value)} call will throw a {@code ClassCastException}.

  1. this()
    class TreeMap(K, V)
    this
    ()
    if (
    isOrderingComparable!K
    )
  2. this(Comparator!K comparator)
  3. this(Map!(K, V) m)

Meta