Available on java
ceilingEntry(param1:K):Map_Entry<K, V>
ceilingKey(param1:K):K
clear():Void
comparator():Comparator<Dynamic>
@:java.defaultcompute(param1:K, param2:BiFunction<Dynamic, Dynamic, V>):V
@:java.defaultcomputeIfAbsent(param1:K, param2:Function<Dynamic, V>):V
@:java.defaultcomputeIfPresent(param1:K, param2:BiFunction<Dynamic, Dynamic, V>):V
containsKey(param1:Dynamic):Bool
containsValue(param1:Dynamic):Bool
descendingKeySet():NavigableSet<K>
descendingMap():NavigableMap<K, V>
entrySet():Set<Map_Entry<K, V>>
firstEntry():Map_Entry<K, V>
firstKey():K
floorEntry(param1:K):Map_Entry<K, V>
floorKey(param1:K):K
@:java.defaultforEach(param1:BiConsumer<Dynamic, Dynamic>):Void
get(param1:Dynamic):V
@:java.defaultgetOrDefault(param1:Dynamic, param2:V):V
headMap(param1:K):SortedMap<K, V>
headMap(param1:K, param2:Bool):NavigableMap<K, V>
higherEntry(param1:K):Map_Entry<K, V>
higherKey(param1:K):K
isEmpty():Bool
keySet():Set<K>
lastEntry():Map_Entry<K, V>
lastKey():K
lowerEntry(param1:K):Map_Entry<K, V>
lowerKey(param1:K):K
@:java.defaultmerge(param1:K, param2:V, param3:BiFunction<Dynamic, Dynamic, V>):V
navigableKeySet():NavigableSet<K>
pollFirstEntry():Map_Entry<K, V>
pollLastEntry():Map_Entry<K, V>
put(param1:K, param2:V):V
putAll(param1:Map<K, V>):Void
@:java.defaultputIfAbsent(param1:K, param2:V):V
@:java.defaultremove(param1:Dynamic, param2:Dynamic):Bool
remove(param1:Dynamic):V
@:java.defaultreplace(param1:K, param2:V):V
@:java.defaultreplace(param1:K, param2:V, param3:V):Bool
@:java.defaultreplaceAll(param1:BiFunction<Dynamic, Dynamic, V>):Void
size():Int
subMap(param1:K, param2:K):SortedMap<K, V>
subMap(param1:K, param2:Bool, param3:K, param4:Bool):NavigableMap<K, V>
tailMap(param1:K):SortedMap<K, V>
tailMap(param1:K, param2:Bool):NavigableMap<K, V>
values():Collection<V>