code wiki / _hdl_build / nx_site_quality_gate.nx
nx_site_quality_gate.nx
buildroot/runtime/_hdl_build/nx_site_quality_gate.nx
about
nx_site_quality_gate.nx -- the STANDING site-quality gate (operator 2026-06-09: "easy for a
nielsen norman or other award winning ux cx benchmarking and ada and w3c compliant and all that
OVER AND OVER with simple management"). Composes the team's sourced rubric line (nx_ux_benchmark =
NN/g + WCAG 2.1 AA) into a RE-RUNNABLE mechanical gate over any HTML artifact: a DATA-DRIVEN
criteria table (law #11 -- the team EXPANDS quality by adding rows, never by editing logic),
permil score, per-criterion verdicts, durable log. Wire into the Conductor's loop so every site
edit re-gates automatically (hot content already swaps live; now quality re-checks ride along).
Rung-1 criteria = the mechanically-checkable WCAG/NN slice; contrast/keyboard-order need a DOM/CSS
rung (flagged, not faked). license_tier: ORIGINAL
dependencies 1 imports · 0 importers
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
structs
| none |
consts
| none |
functions
| 11 | func _p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 12 | func _pn(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;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 } |
| 13 | func _fp(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 14 | func _fn(fd: i64, 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(fd,bb,k); return 0 } |
| 15 | func sq_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 16 | func sq_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 30 | func sq_count(buf: *u8, n: i64, pat: *u8) -> i64 |
| 46 | func sq_criterion(id: i64, buf: *u8, n: i64) -> i64 |
| 99 | func sq_pos(buf: *u8, n: i64, pat: *u8) -> i64 |
| 111 | func sq_name(id: i64) -> *u8 called by 1: main |
| 126 | func main(argc: i64, argv: *i64) -> i64 |