Collection
Arrays, maps and trees — the ways Program holds more than one value. Collection is organised into
the sub-modules below, each a reactive container: an Array is an
ordered list, a Map looks values up by key, an
Optional holds a value or nothing, and a
Tree nests nodes into a hierarchy. Each is generic over its
element type — Collection.Array(Text), Collection.Map(Maths.Integer) —
and every read stays live, recomputing as the container changes.
Contents
Submodules
- Collection.Array — An ordered, growable list of values of a single type.
- Collection.Map — A dictionary of entries, each value looked up by a key.
- Collection.Optional — An optional value — present with a value, or absent.
- Collection.Tree — A hierarchical tree of nodes, each with child nodes.