(rontolisp) docs
← Maps, sets and vectors

hash-map

(hash-map k v ...)

Answers a map built from the key/value pairs: an equal hash table, never mutated in place -- every verb builds a fresh one, so persistence holds observably. Walk order is unspecified. Odd pair counts are refused.

As a value a rest lambda over the pairs; an odd rest count signals at run time.

Deviation: hash-map and array-map are identical here -- both build the same equal table, where the oracle keeps insertion order in array-map.