Map

extends Node

Map provides a fast lookup data storage that uses a hashing algorithm to store and retrieve keys.

Constructors

Map other, Node deep map = new java.util.HashMap(); // tbd deep copy map.putAll(other.map);

Create a new, empty map.

map = new java.util.HashMap();

Type Functions

get(Node key)

Get an entry from the map.

Returns: The value stored in the map under this key, or an empty nodeset if none.

keys()

Get the keys contained in this map

nodes()

Get the values contained in this map

put(Node key, Node value)

Add an entry to the map.

Returns: The Map that the function was invoked on.

remove(Node key)

Remove an entry from the map.

Returns: The value stored in the map under this key, or an empty nodeset if none.

size()

Get the number of key/value pairs in this Map.

values()

Get the values contained in this map

Functions inherited from Node