TreeMap.this

Constructs a new tree map containing the same mappings as the given map, ordered according to the <em>natural ordering</em> of its keys. All keys inserted into the new 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. This method runs in n*log(n) time.

@param m the map whose mappings are to be placed in this map @throws ClassCastException if the keys in m are not {@link Comparable}, or are not mutually comparable @throws NullPointerException if the specified map is null

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

Meta