code wiki / (root) / nx_ui_exceed.nx

nx_ui_exceed.nx

buildroot/runtime/nx_ui_exceed.nx

5506 B77 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic ui
docsdependenciesstructsconstsfunctions

about

nx_ui_exceed.nx -- the HONEST measured S-class-exceed scorecard: where our UI provably EXCEEDS the field on axes that are (a) measurable on both sides and (b) grounded in a REAL fetched benchmark -- and an honest list of where we do NOT claim to exceed (the subjective/JS-creativity ceiling). Grounded in the Nishi researcher's banked WebAIM Million 2026 report (knowledge/fetched/aw_webaim_million.raw, fetched live, status 200): * 95.9% of the top-1,000,000 home pages FAIL WCAG 2 (only 4.1% conform) * 83.9% of home pages have LOW-CONTRAST TEXT * avg 1437 elements / home page (+22.5% in one year) OUR side is MEASURED this session: nx_ui_contrast = 6/6 pages AAA (9.78-18.18:1); ship-gate = 6-invariant a11y enforced by construction; pages are sovereign (0 external assets) and lean (~14KB). Liar-kill: an EXCEEDS needs BOTH a cited benchmark AND our measured result. Subjective award-BEAUTY is NOT claimed (jury-judged). 100% sovereign. license_tier: ORIGINAL expect_exit: 0

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_ui_exceed.nx

imports: nx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sys_mmap sw sys_write row sw ↻ grade_name sw ↻ cap_valid sn sys_mmap ↻ sys_write ↻ cap_valid ↻ sys_exit

structs

none

consts

14const G_ABSENT: i64 = 0
15const G_PRESENT: i64 = 1
16const G_PARITY: i64 = 2
17const G_EXCEEDS: i64 = 3

functions

19func sw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
called by 3: grade_namerowmain calls 1: sys_write
20func sn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} 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 }
called by 1: main calls 2: sys_mmapsys_write
22func grade_name(g: i64) -> i64
called by 1: row calls 1: sw
29func cap_valid(grade: i64, has_ev: i64) -> i64 { if grade >= G_PARITY { if has_ev == 0 { return 0 } } return 1 }
called by 2: rowmain
31func row(dim: *u8, claim: *u8, grade: i64, bench: *u8, ev: *u8, has_ev: i64, tot: *i64) -> i64
called by 1: main calls 3: swgrade_namecap_valid
40func main() -> i64