LinkedHashTreeMap

Create a natural order, empty tree map whose keys must be mutually comparable and non-null.

open fun LinkedHashTreeMap()

Create a tree map ordered by {@code comparator} . This map's keys may only be null if {@code * comparator} permits.

Parameters

comparator

the comparator to order elements with, or {@code null} to use the natural ordering.

open fun LinkedHashTreeMap(comparator: Comparator<out Any>)