AvlMap Reference

Ordered key-value container implemented as an AVL tree.

AVLMap

Construct with key and value schemas in front of the module name, for example Int32 Int32 AVLMap.

AVL_MAP: map marker field.
keyType: Ref to the key schema.
valueType: Ref to the value schema.
nodeType: node schema with fields key, value, balance, left, and right.
root: root-node address stored as Natx.

makeNode: constructs one node value from key and value inputs.
asNode: interprets one node address as nodeType Ref.
fixRotateLeft and fixRotateRight: balancing helpers used after insertion and erasure.
swapNodes: node-swap helper used during erasure.

Keys are compared through = and <.
insert rejects an existing key.
erase rejects a missing key.
debugPrint visits the stored pairs in ascending key order.
The page does not define a size field or size method.
A newly initialized map stores 0nx in root and therefore has no nodes.
insert allocates one new node and stores copied key and value data in that node.
erase destroys and frees exactly one stored node.
clear destroys every stored node and resets root to the empty state.
ASSIGN deep-clones the whole tree. The new map does not share node storage with the source map.

success: reports whether the key was found.
value: Ref to the stored value when success is TRUE.
When success is FALSE, value is a nil ref of valueType.
References returned by find.value may be invalidated by later insert, erase, clear, ASSIGN, or DIE.

Consumes one AVLMap through one body and visits the stored pairs in ascending key order.

source must provide the AVL_MAP marker field.
The body receives one record with fields key and value.
key is passed by value.
value is passed as Ref to the stored value.
Those value refs may be invalidated by later insert, erase, clear, ASSIGN, or DIE.