Where a windowed structure's bits go — 30,000 arrivals, W = 4,096

Where a windowed structure's bits go — 30,000 arrivals, W = 4,096

4 structures over the same stream, each bar the whole of its state and split into what the bits are for. Only the two rightmost bands are the answer; the rest is knowing which item and knowing when. windowed HyperLogLog holds 4,088 bits, 50% of it stamps; one stamp per live key holds 8,775 bits, 29% of it stamps; blocks of Misra-Gries holds 18,549 bits, 1% of it stamps; the last W keys, kept holds 131,072 bits and keeps no clock. The parts are computed from each structure's own shape and are required to sum to the total it reports, so a band that had been left out of the accounting would stop the build rather than make a bar look short.

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

3 essays call state-parts. 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.