Set A
Set<string>a
Waiting for the peer…
Open the other process ↗Each process owns two leaves and computes every function locally. Only owned leaves are editable here. One bidirectional WebSocket carries all peer watches and deltas. Transactions are atomic locally; cross-process delivery is atomic per leaf and eventually consistent.
Disconnected. These are cached browser values, not live state. Reconnect to replace them with a fresh snapshot. Edits are disabled and never queued for replay.
01 Mutable leaves YOU EDIT
Set B
Set<string>b
Points per rune
intGarden name
string02 Collection functions SERVER COMPUTES
Unique words
Set<string>union = nodes.Union(a, b)
One member, even if both inputs contain it. Only the last removal propagates.
A value for every key
Map<string, Word>details = nodes.MapSet(union, wordInfo)
| Key | Uppercase | Runes |
|---|
F(k) → {uppercase, rune count}. Keys stay the same; an added word computes just its own value. Its rune count contributes to the total and score.
03 Derived outputs READ ONLY
Total runes
inttotalRunes = Sum(details.runes)
—
Sum of rune counts across unique words. Updates add new counts and subtract old ones, without rescanning the map.
Garden points
intscore = totalRunes × weight
—
The final value
stringsummary = Format(label, totalRunes, score)
Waiting for the graph…
On the wire LIVE WEBSOCKET ACTIVITY
Inspect the last graph message
No messages yet.
Between processes MULTIPLEXED PEER WEBSOCKET
Inspect the last peer message
Waiting for peer traffic…