code wiki / _hdl_build / nx_cms_abtest_gate.nx
nx_cms_abtest_gate.nx
buildroot/runtime/_hdl_build/nx_cms_abtest_gate.nx
about
nx_cms_abtest_gate.nx -- CMS A/B-TESTING + PERSONALIZATION gate: land the missing Nelio/Google-Optimize
class HONESTLY by proving the sovereign deterministic assignment engine over 600 synthetic visitors --
stickiness, valid range, experiment independence, a non-degenerate even split, a weighted 90/10 rollout,
degenerate-safety, and bounded reproducible positions. Positive AND negative controls (a broken even
split or a weighting that ignores weights would FAIL the two-sided tolerances). Appends "CMSGATE row=
nx_cms_abtest ab-testing-personalize ... verdict=PASS" to knowledge/status/cms_gate.log ONLY if every
assertion holds (no fake-green). Exit 0 iff all pass. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_cms_abtest.nxnx_syscalls.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
| 11 | const ABG_N: i64 = 600 // synthetic visitor population |
functions
| 13 | func ag_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 14 | func ag_num(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48;k=1}; while m>0{t[k]=48+(m%10);m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 } |
| 15 | func ag_cat(dst: *u8, off: i64, s: *u8) -> i64 { var o: i64=off; var k: i64=0; while s[k]!=(0 as u8){dst[o]=s[k];o=o+1;k=k+1} return o } called by 1: main |
| 16 | func ag_catnum(dst: *u8, off: i64, v: i64) -> i64 |
| 23 | func ag_vid(buf: *u8, idx: i64) -> i64 |
| 33 | func ag_row(id: i64, ok: i64, what: *u8) -> i64 |
| 40 | func main() -> i64 |