russell@unturf.com
d67ec93a5d
vitest-0001: coverage-v8 coverage.result.find inside merged.result.forEach -> Map<url, result> lookup. Bench: 824x at N=M=10000 coverage entries. testng-0001: DynamicGraph.toDot freeNodes.contains inside two for-each loops -> Map<T, String> color lookup via getOrDefault. Bench: 64x at N=2000. jasmine-0001: SpyRegistry.spyOnAllFunctions propertiesToSkip.indexOf inside Array.filter + .concat growth across D prototype levels -> Set.has + O(1) growth. Bench: 61x at D=10, P=300. check-0001: libcheck suite_tcase linear strcmp scan over tclst List -> parallel hashtable for O(1) lookup amortized. Bench: 117x at N=1000. Shipped as design sketch; full integration requires companion hashtable. Also ships whitepaper/outreach/test-harness-survey.md documenting 14 clean-scan frameworks across Clojure, OCaml, Haskell, Erlang, Go, F#, Julia, Shell, Lua, JS. Scope covered 61 targets across 30+ languages. UNDF IDs: 1292 (check), 1293 (jasmine), 1294 (testng), 1295 (vitest). All 12 tests pass.
7 lines
416 B
Text
7 lines
416 B
Text
=== check-0001: Suite tcase linear strcmp vs hashtable ===
|
|
N=50 lookups=50 : defective=0.042ms fixed=0.007ms speedup=5.9x
|
|
N=100 lookups=100 : defective=0.160ms fixed=0.012ms speedup=13.1x
|
|
N=200 lookups=200 : defective=0.631ms fixed=0.024ms speedup=26.8x
|
|
N=500 lookups=500 : defective=4.131ms fixed=0.067ms speedup=61.8x
|
|
N=1000 lookups=1000 : defective=16.796ms fixed=0.143ms speedup=117.1x
|
|
|