The partition does not change the bill, only who pays it

The partition does not change the bill, only who pays it

The heaviest key of 40,000 arrivals of stationary Zipf — the control, where a window is a smaller sample, across 8 shards of 32 counters. Each bar is the sum of the 8 shard floors under that partition, divided into the part a Space-Saving merge will pay and the part a Misra-Gries merge will pay. round 0/967, hashed 509/97, blocked 0/967. The two structures are related by subtracting a single number and their merges read opposite columns of the same table.

Drawn at 700 × 254, wide on the page. Everything above is what merge-bill 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-bill. 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.