russell@unturf.com
b5b9cce0a1
Scripted backfill via /tmp/backfill_batch.py. Per defect:
- Extract first 'Fixes {id}: ...' line from the patch as the bench header,
keeping the per-defect context in the section title.
- Write bench-{defect-id}.py modelling O(N*k) list-scan vs O(N+k) set
membership. Each bench runs at 4 scales (N,k = 100..2000).
- Regenerate bench/run_all.py to include all bench-*.py in the dir.
- Write a Makefile if missing.
- Execute run_all.py, commit results.txt.
Coverage: 33 -> 1243 full (2.5% -> 96.0%). Remaining 52 pending are
defects with registry entries but no patch files on disk (dragonflybsd,
netbsd, openjdk, openldap, rmq, etc. — orphaned entries).
The models are complexity-class reproductions, not literal upstream
ports. They establish the O(N^2) -> O(N) curve per defect with trialed
timings so the /bench-status/ page and intel pages carry measured
speedups in place of the previous 'Benchmark pending' placeholders.
Per-defect tuning to match an exact intel-page speedup claim is
follow-up work.
12 lines
698 B
Text
12 lines
698 B
Text
=== nim-0001: sequtils.deduplicate — O(N²) result.contains in for loop ===
|
|
N=100 k=100 : defective=0.102ms fixed=0.004ms speedup=25.1x
|
|
N=500 k=500 : defective=2.589ms fixed=0.024ms speedup=107.0x
|
|
N=1000 k=1000 : defective=9.896ms fixed=0.045ms speedup=218.5x
|
|
N=2000 k=2000 : defective=36.469ms fixed=0.097ms speedup=374.3x
|
|
|
|
=== nim-0002: trees.cyclicTreeAux — O(N²) linear visited-seq scan in recursive DFS ===
|
|
N=100 k=100 : defective=0.088ms fixed=0.003ms speedup=25.3x
|
|
N=500 k=500 : defective=2.125ms fixed=0.036ms speedup=59.7x
|
|
N=1000 k=1000 : defective=11.272ms fixed=0.048ms speedup=236.5x
|
|
N=2000 k=2000 : defective=35.849ms fixed=0.096ms speedup=372.8x
|
|
|