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 | 10 | 0.97 | 1.000 | 125 | 877 | 2.00× |
compileInner grows by 751 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 | 107 | 717 | +610 | 81% | 0.92× | 0.94 |
| generateIR | 12 | 119 | +107 | 14% | 1.40× | 1.13 |
| generateOutput (self) | 5 | 29 | +25 | 3% | 1.21× | 1.16 |
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 | 125 | 107 | 121 |
| 250 | 229 | 197 | 221 |
| 500 | 438 | 372 | 422 |
| 1000 | 877 | 717 | 847 |