View source

class 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 also:

Constructor

new()

Creates a new WeakMap.

Methods

copy():WeakMap<K, V>

See Map.copy

exists(key:K):Bool

See Map.exists

get(key:K):Null<V>

See Map.get

iterator():Iterator<V>

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

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

inlinekeyValueIterator():KeyValueIterator<K, V>

See Map.keyValueIterator

keys():Iterator<K>

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

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

See Map.toString

toString():String

Available on java

Returns an displayable representation of the hashtable content.