nx_mrshuffle_gate.nx
buildroot/runtime/nx_mrshuffle_gate.nx
about
nx_mrshuffle_gate.nx -- proves the shuffle is a CORRECT distributed dataflow: every key routes to exactly
one reducer (disjoint partitioning by hash), each reducer sees all its rows, and the union of the parallel
reducers equals the monolithic group-by -- for several reducer counts, with high key cardinality, under
REAL forked concurrency. D001 verdict via nx_gate_verdict. expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_gate_verdict.nxnx_mrshuffle.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 sg_eq(a: i64, b: i64) -> i64 { if a == b { return 1 } return 0 } called by 1: main |
| 9 | func sg_frame2(a: *i64, b: *i64, na: *u8, nb: *u8, n: i64) -> *u8 |
| 22 | func main() -> i64 |