nx_font_legib_census.nx
buildroot/runtime/nx_font_legib_census.nx
about
nx_font_legib_census.nx -- what S-CLASS-EXCEED means for LEGIBILITY + ACCESSIBILITY (ADA / dyslexia / low-vision)
+ BEAUTY, grounded in the Nishi researcher's leg_*.raw (Atkinson Hyperlegible [Braille Institute, low-vision,
character disambiguation], Legibility, Readability, Dyslexia, X-height, Frutiger, Verdana). Honest grade of the
CURRENT geometric A-Z (nx_font_latin) -- which the operator correctly called blocky/unpolished. ABSENT cells =
the redesign targets. GREEN = honest map (not a win). license_tier: ORIGINAL expect_exit: 0
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
| 8 | const G_ABSENT: i64=0 |
| 9 | const G_PARTIAL: i64=1 |
| 10 | const G_PRESENT: i64=2 |
functions
| 12 | func sw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 13 | func 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 } |
| 14 | func gname(g: i64) -> i64 { if g==0 { sw("ABSENT " as *u8) } if g==1 { sw("PARTIAL" as *u8) } if g==2 { sw("PRESENT" as *u8) } return 0 } |
| 15 | func row(p: *u8, cap: *u8, g: i64, principle: *u8, tot: *i64) -> i64 |
| 20 | func main() -> i64 |