nx_qplan_gate.nx
buildroot/runtime/nx_qplan_gate.nx
about
nx_qplan_gate.nx -- proves the cost-based planner CHOOSES CORRECTLY, matching the reality the parexec
bench measured: small data -> sequential (fork not worth it); large bandwidth-bound scan -> sequential
(parallel loses, measured 0.66x); large compute-bound -> parallel (measured 3.10x). Also proves the
estimates are internally ordered and monotone. Known cost profiles, deterministic. D001 via nx_gate_verdict.
dependencies 2 imports · 0 importers
imports: nx_gate_verdict.nxnx_qplan.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 8 | func qg_eq(a: i64, b: i64) -> i64 { if a == b { return 1 } return 0 } called by 1: main |
| 10 | func main() -> i64 |