garden library

Classes

Garden
Coordinates transactional mutations across connected Leaf instances.
ListLeaf<T>
A Leaf list implementation with branch-aware undo recording.
MapLeaf<K, V>
A Leaf map implementation with branch-aware undo recording.
RelationLeaf<K, V>
A Leaf that stores bidirectional key-value pairs with forward and reverse indexes, supporting 1-1, 1-N, N-1, and N-N relationships.
RelationLeaf11<K, V>
A one-to-one RelationLeaf. Both keys and values are unique.
RelationLeaf1N<K, V>
A one-to-many RelationLeaf. Each value belongs to at most one key.
RelationLeafN1<K, V>
A many-to-one RelationLeaf. Each key maps to at most one value.
RelationLeafNN<K, V>
A many-to-many RelationLeaf. No cardinality constraints.
RngLeaf
A leaf with resumable RNG state, powered by chaos.
SetLeaf<T>
A Leaf set implementation with branch-aware undo recording.
ValueLeaf<T>
A Leaf that tracks mutations to a single boxed value.

Mixins

Leaf
Mixin for state wrappers that participate in a Garden.