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.
65 lines
1.9 KiB
Python
65 lines
1.9 KiB
Python
#!/usr/bin/env python3
|
|
# bench-testng-0001.py
|
|
# DynamicGraph.toDot: freeNodes.contains (List, O(F)) per node vs HashSet.
|
|
|
|
import sys
|
|
import time
|
|
|
|
|
|
def bench_defective(n, f_size):
|
|
"""List.contains per node in two nested loops."""
|
|
nodes_ready = list(range(n))
|
|
nodes_running = list(range(n, 2 * n))
|
|
# Half of ready/running are in freeNodes
|
|
free_nodes = list(range(0, n, 2)) + list(range(n, 2 * n, 2))
|
|
|
|
t0 = time.perf_counter()
|
|
buf = []
|
|
for node in nodes_ready:
|
|
is_free = node in free_nodes # list.__contains__ = O(F)
|
|
buf.append(f"n{node}:{is_free}")
|
|
for node in nodes_running:
|
|
is_free = node in free_nodes
|
|
buf.append(f"n{node}:{is_free}")
|
|
return time.perf_counter() - t0
|
|
|
|
|
|
def bench_fixed(n, f_size):
|
|
"""Pre-built HashSet for O(1) membership."""
|
|
nodes_ready = list(range(n))
|
|
nodes_running = list(range(n, 2 * n))
|
|
free_nodes = list(range(0, n, 2)) + list(range(n, 2 * n, 2))
|
|
|
|
t0 = time.perf_counter()
|
|
free_set = set(free_nodes)
|
|
buf = []
|
|
for node in nodes_ready:
|
|
is_free = node in free_set # O(1)
|
|
buf.append(f"n{node}:{is_free}")
|
|
for node in nodes_running:
|
|
is_free = node in free_set
|
|
buf.append(f"n{node}:{is_free}")
|
|
return time.perf_counter() - t0
|
|
|
|
|
|
TRIALS = 3
|
|
SIZES = [50, 200, 500, 1000, 2000]
|
|
|
|
|
|
def run():
|
|
lines = []
|
|
header = "=== testng-0001: DynamicGraph.toDot List.contains vs HashSet ==="
|
|
print(header); lines.append(header)
|
|
|
|
for n in SIZES:
|
|
d = min(bench_defective(n, n) for _ in range(TRIALS))
|
|
f = min(bench_fixed(n, n) for _ in range(TRIALS))
|
|
speedup = (d / f) if f > 0 else float("inf")
|
|
line = f"N={n:<5}: defective={d*1000:.3f}ms fixed={f*1000:.3f}ms speedup={speedup:.1f}x"
|
|
print(line); lines.append(line); sys.stdout.flush()
|
|
|
|
return lines
|
|
|
|
|
|
if __name__ == "__main__":
|
|
run()
|