The four that ship, audited on random input

The four that ship, audited on random input

Each declares a complexity class; the class is fitted to comparison counts over fitted n = 256–16,384 and granted only if the ratio count ⁄ f(n) stays flat to within 1.6. The bar is that spread, so shorter is a better fit and 1.0 would be exact. All four claims hold. The range starts at 256 rather than at 32, because below a few hundred elements each of these is its own insertion cutoff and the fit would be measuring the threshold.

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

1 essay calls library-audit. 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.