Available on jvm
new(param1:Int, param2:Single)
new(param1:Int, param2:Single, param3:Bool)
new(param1:Map<K, V>)
new()
new(param1:Int)
finalaccessOrder:Bool
head:LinkedHashMap_Entry<K, V>
tail:LinkedHashMap_Entry<K, V>
removeEldestEntry(param1:Map_Entry<K, V>):Bool
modCount:Int
table:NativeArray<HashMap_Node<K, V>>
threshold:Int
finalcapacity():Int
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
finalgetNode(param1:Int, param2:Dynamic):HashMap_Node<K, V>
finalloadFactor():Single
merge(param1:K, param2:V, param3:BiFunction<Dynamic, Dynamic, V>):V
putIfAbsent(param1:K, param2:V):V
finalputMapEntries(param1:Map<K, V>, param2:Bool):Void
finalputVal(param1:Int, param2:K, param3:V, param4:Bool, param5:Bool):V
finalremoveNode(param1:Int, param2:Dynamic, param3:Dynamic, param4:Bool, param5:Bool):HashMap_Node<K, V>
replace(param1:K, param2:V, param3:V):Bool
replace(param1:K, param2:V):V
finalresize():NativeArray<HashMap_Node<K, V>>
finaltreeifyBin(param1:NativeArray<HashMap_Node<K, V>>, param2:Int):Void
equals(param1:Dynamic):Bool
hashCode():Int
toString():String