code wiki / _hdl_build / nx_freeform_exceed_gate.nx
nx_freeform_exceed_gate.nx
buildroot/runtime/_hdl_build/nx_freeform_exceed_gate.nx
about
nx_freeform_exceed_gate.nx -- RE-MEASURE of AXIS D (free-form canvas) after building the free-form tier, through
the no-overclaim referee (nx_cms_exceed). Earlier (nx_studio_exceed_gate) AXIS D was an HONEST BEHIND: ours had
no free-form canvas (0 vs 1). Now the free-form tier exists (engine nx_sitegen_freeform + canvas UI + wiring),
so we re-measure -- HONESTLY, not as a wave:
D1 free-form placement EXISTS : ours now = 1 (MEASURED: a canvas doc positions elements at x/y/w), Wix = 1
-> PARITY (we CLOSED the prior BEHIND; we do NOT claim to beat Wix here).
D2 governed+portable free-form: ours = 1 (MEASURED: escaped + byte-identical rebuild), Wix = 0 (its free-form
is not portable/sovereign) -> AHEAD (refereed).
D3 free-form editor MATURITY : snapping / alignment guides / responsive variants / huge widget library --
ours = 0, Wix = 1 -> still BEHIND (honest, NOT claimed).
So AXIS D flips from BEHIND to {PARITY on capability, AHEAD on governed+portable} while maturity stays BEHIND.
license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_studio_tiers.nxnx_cms_exceed.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
| none |
functions
| 17 | func rxw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 18 | func rxn(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 as u8;k=1}; while m>0{t[k]=(48+(m%10)) as u8;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 } |
| 19 | func rxcat(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 |
| 20 | func rxcatn(dst: *u8, off: i64, v: i64) -> i64 { var o: i64=off; let t: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; var k: i64=0; if m==0{t[0]=48 as u8;k=1}; while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1}; var i: i64=0; while i<k{dst[o]=t[k-1-i];o=o+1;i=i+1} return o } |
| 21 | func rxrow(id: i64, ok: i64, what: *u8) -> i64 { rxw("RXROW " as *u8); rxn(id); rxw(" " as *u8); if ok==1 { rxw("PASS " as *u8) } else { rxw("FAIL " as *u8) } rxw(what); rxw("\n" as *u8); return ok } |
| 22 | func rxlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 23 | func rxhas(hay: *u8, hn: i64, needle: *u8) -> i64 called by 1: main |
| 30 | func rxeq(a: *u8, an: i64, b: *u8, bn: i64) -> i64 { if an!=bn { return 0 } var i: i64=0; while i<an { if (a[i] as i64)!=(b[i] as i64){return 0} i=i+1 } return 1 } called by 1: main |
| 32 | func main() -> i64 |