WeakMap<K, V>

package haxe.ds

implements IMap<K, V>

Available on all platforms

WeakMap 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:

https://haxe.org/manual/std-Map.html

Constructor

new ()

Creates a new WeakMap.

Methods

exists (key:K ):Bool

See Map.exists

get (key:K ):Null<V>

See Map.get

iterator ():Iterator<V>

Available on cpp, cs, flash, hl, js, lua, macro, neko, php, python

See 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 cpp, cs, flash, hl, js, lua, macro, neko, php, python

See Map.keys

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

remove (key:K ):Bool

See Map.remove

set (key:K, value:V ):Void

See Map.set

toString ():String

Available on cpp, cs, flash, hl, js, lua, macro, neko, php, python

See Map.toString

toString ():String

Available on java

Returns an displayable representation of the hashtable content.