Both merges priced from the histograms, then run

Both merges priced from the histograms, then run

40,000 arrivals of stationary Zipf — the control, where a window is a smaller sample across 8 shards, hashed by key: every key on one shard, 32 counters each. The predicted numbers come from the shard histograms and the fixed point alone — no summary is allocated and no arrival is replayed. Space-Saving: 537 predicted against 536 measured. Misra-Gries: 154 against 152. The two structures are the same structure under a stream and their merges are 3.5× apart here.

Drawn at 700 × 284, wide on the page. Everything above is what merge-damage-predicted returns with no arguments; the caption is the generator's own, computed from the numbers in the drawing rather than written beside it.

4 essays call merge-damage-predicted. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about — which is what optcheck and figfill exist to catch.