Available on java
ceilingEntry(param1:K):Map_Entry<K, V>
ceilingKey(param1:K):K
descendingKeySet():NavigableSet<K>
descendingMap():NavigableMap<K, V>
firstEntry():Map_Entry<K, V>
floorEntry(param1:K):Map_Entry<K, V>
floorKey(param1:K):K
higherEntry(param1:K):Map_Entry<K, V>
higherKey(param1:K):K
lastEntry():Map_Entry<K, V>
lowerEntry(param1:K):Map_Entry<K, V>
lowerKey(param1:K):K
navigableKeySet():NavigableSet<K>
pollFirstEntry():Map_Entry<K, V>
pollLastEntry():Map_Entry<K, V>
clear():Void
compute(param1:K, param2:BiFunction<Dynamic, Dynamic, V>):V
computeIfAbsent(param1:K, param2:Function<Dynamic, V>):V
computeIfPresent(param1:K, param2:BiFunction<Dynamic, Dynamic, V>):V
containsKey(param1:Dynamic):Bool
containsValue(param1:Dynamic):Bool
entrySet():Set<Map_Entry<K, V>>
equals(param1:Dynamic):Bool
forEach(param1:BiConsumer<Dynamic, Dynamic>):Void
get(param1:Dynamic):V
getOrDefault(param1:Dynamic, param2:V):V
hashCode():Int
isEmpty():Bool
merge(param1:K, param2:V, param3:BiFunction<Dynamic, Dynamic, V>):V
put(param1:K, param2:V):V
putAll(param1:Map<K, V>):Void
putIfAbsent(param1:K, param2:V):V
remove(param1:Dynamic, param2:Dynamic):Bool
remove(param1:Dynamic):V
replace(param1:K, param2:V):V
replace(param1:K, param2:V, param3:V):Bool
replaceAll(param1:BiFunction<Dynamic, Dynamic, V>):Void
size():Int
toString():String
values():Collection<V>