Constructs a new, empty tree map, ordered according to the given
comparator. All keys inserted into the map must be mutually
comparable by the given comparator: comparator.compare(k1,
k2)
must not throw a ClassCastException
for any keys
k1
and k2
in the map. If the user attempts to put
a key into the map that violates this constraint, the put(Object
key, Object value)
call will throw a
ClassCastException
.
comparator | the comparator that will be used to order this map.
If null , the natural of the keys will be used. |
Diagram: Map Simple