n distinct generic functions with interface constraints, each instantiated at several concrete types. Stresses semantic checking, generic constraint satisfaction and instantiation in the front-end. Scaling null: n scales instantiation count against a fixed generic set; ideal checking cost is O(n).
bucket: sema · mode: module · flags: (none)
compileInner split into phase buckets (named leaves + (self) residuals) stacked across the sweep sizes — the top edge is compileInner, so you can see which phase drives the scaling.
floor-subtracted power-law fit (t − floor) = a·Nk; floor = the minimal workload (fixed per-compile cost), k the global exponent, top-2× the local high-end doubling ratio.
| N range | floor (ms) | k (work) | fit R² | t(Nmin) | t(Nmax) | top-2× |
|---|---|---|---|---|---|---|
| 125–1000 | 14 | 0.99 | 1.000 | 145 | 1045 | 2.01× |
compileInner grows by 900 ms across the sweep; the mutually-exclusive phase buckets below partition that growth exactly (no nested-timer double counting). × lin is the same metric as the top-level panels, per bucket: the end point vs a linear expectation anchored to the bucket's share of the minimal floor and fitted on the low-N half — 1.0 = grew exactly linearly, >1 bends up. The super-linearity lives where × lin (and k) are red.
| bucket | t@N=125 | t@N=1000 | Δ ms | share | × lin | ∝Nk |
|---|---|---|---|---|---|---|
| SemanticChecking | 128 | 884 | +757 | 84% | 0.94× | 0.95 |
| generateIR | 11 | 120 | +109 | 12% | 1.45× | 1.17 |
| generateOutput (self) | 4 | 30 | +26 | 3% | 1.18× | 1.20 |
Near-constant (≤2% of growth each): parseTranslationUnit (1→10 ms), frontEndExecute (self) (0→1 ms), compileInner (self) (0→0 ms).
| N | compileInner | SemanticChecking | frontEndExecute |
|---|---|---|---|
| 125 | 145 | 128 | 141 |
| 250 | 271 | 238 | 262 |
| 500 | 520 | 455 | 505 |
| 1000 | 1045 | 884 | 1015 |