Returns a new modifiable map, initialized with the specified items.
The map is implemented as a tree, which has a couple of trade offs. The order of iteration over the key-value pairs in the map will be in the natural ascending sort order of the keys. Also adding and modifying key-value pairs is proportional the the logarithm of the number of key-value pairs in the map.
The map is initialized with the items you supply as arguments. This function deals with arguments in exactly the same way as the newMap function, so that information isn't repeated here.
If you know you will not add or modify key-value pairs often and aren't concerned with the iteration order, consider using newHashMap instead.
If you know you will not add or modify key-value pairs often, but the iteration order is important, consider using newLinkedHashMap instead.
If you want a map where the key-value pairs are automatically removed when the key is no longer in use, consider using newWeakHashMap instead.