package haxe.ds
implements IMap<K, V>
Available on all platformsWeakMap allows mapping of object keys to arbitrary values.
The keys are considered to be weak references on static targets.
See
Map
for documentation details.See:
new ()
Creates a new WeakMap.
exists (key:K ):Bool
Map.exists
get (key:K ):Null<V>
Map.get
iterator ():Iterator<V>
Available on cpp, cs, flash, hl, js, lua, macro, neko, php, python
Map.iterator
iterator ():Iterator<V>
Available on java
Returns an iterator of all values in the hashtable. Implementation detail: Do not set() any new value while iterating, as it may cause a resize, which will break iteration
keys ():Iterator<K>
Available on java
Returns an iterator of all keys in the hashtable. Implementation detail: Do not set() any new value while iterating, as it may cause a resize, which will break iteration
keys ():Iterator<K>
Available on cpp, cs, flash, hl, js, lua, macro, neko, php, python
Map.keys
remove (key:K ):Bool
Map.remove
set (key:K, value:V ):Void
Map.set
toString ():String
Available on java
Returns an displayable representation of the hashtable content.
toString ():String
Available on cpp, cs, flash, hl, js, lua, macro, neko, php, python
Map.toString
© 2005–2018 Haxe Foundation
Licensed under a MIT license.
https://api.haxe.org/haxe/ds/WeakMap.html