code wiki / _hdl_build / nx_prefix_gate.nx

nx_prefix_gate.nx source

↩ module page · 52 lines · 4328 B

1// nx_prefix_gate.nx -- KAT for R-UX-3 (nx_prefix): as-you-type suggestions over a sorted real-search vocab. 2// expect_exit: 0 license_tier: ORIGINAL 3import "nx_syscalls.nx" 4import "nx_prefix.nx" 5 6func pg_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } 7func pg_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 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 } 8func pg_w(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 } 9func pg_wn(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 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(fd,bb,k); return 0 } 10func pg_putt(t: *u8) -> i64 { var n: i64=0; while t[n]!=(0 as u8){n=n+1} sys_write(1,t,n); sys_write(1," " as *u8,1); return 0 } 11 12func main() -> i64 { 13 pg_puts("=== R-UX-3 PREFIX AUTOCOMPLETE -- as-you-type over sorted real-search vocab ===\n" as *u8) 14 // sorted vocab (real andelinwest/search terms) 15 let V: *i64=sys_mmap(8*16) as *i64 16 V[0]="alimony\x00" as *u8 as i64; V[1]="business\x00" as *u8 as i64; V[2]="claim\x00" as *u8 as i64 17 V[3]="contract\x00" as *u8 as i64; V[4]="custody\x00" as *u8 as i64; V[5]="divorce\x00" as *u8 as i64 18 V[6]="estate\x00" as *u8 as i64; V[7]="inheritance\x00" as *u8 as i64; V[8]="injury\x00" as *u8 as i64 19 V[9]="probate\x00" as *u8 as i64; V[10]="trust\x00" as *u8 as i64 20 let N: i64=11 21 let out: *i64=sys_mmap(8*16) as *i64 22 23 var pass: i64=0; var total: i64=0 24 // "div" -> divorce (1) 25 let m1: i64=vr_prefix_collect(V, N, "div\x00" as *u8, 3, out) 26 pg_puts(" 'div' -> " as *u8); var i: i64=0; while i<m1 { pg_putt(V[out[i]] as *u8); i=i+1 } pg_puts(" (" as *u8); pg_pn(m1); pg_puts(") " as *u8) 27 total=total+1; if m1==1 { pass=pass+1; pg_puts("PASS\n" as *u8) } else { pg_puts("FAIL\n" as *u8) } 28 // "in" -> inheritance, injury (2) 29 let m2: i64=vr_prefix_collect(V, N, "in\x00" as *u8, 2, out) 30 pg_puts(" 'in' -> " as *u8); i=0; while i<m2 { pg_putt(V[out[i]] as *u8); i=i+1 } pg_puts(" (" as *u8); pg_pn(m2); pg_puts(") " as *u8) 31 total=total+1; if m2==2 { pass=pass+1; pg_puts("PASS\n" as *u8) } else { pg_puts("FAIL\n" as *u8) } 32 // "c" -> claim, contract, custody (3) 33 let m3: i64=vr_prefix_collect(V, N, "c\x00" as *u8, 1, out) 34 pg_puts(" 'c' -> " as *u8); i=0; while i<m3 { pg_putt(V[out[i]] as *u8); i=i+1 } pg_puts(" (" as *u8); pg_pn(m3); pg_puts(") " as *u8) 35 total=total+1; if m3==3 { pass=pass+1; pg_puts("PASS\n" as *u8) } else { pg_puts("FAIL\n" as *u8) } 36 // "z" -> none (0) 37 let m4: i64=vr_prefix_collect(V, N, "z\x00" as *u8, 1, out) 38 pg_puts(" 'z' -> (none) (" as *u8); pg_pn(m4); pg_puts(") " as *u8) 39 total=total+1; if m4==0 { pass=pass+1; pg_puts("PASS\n" as *u8) } else { pg_puts("FAIL\n" as *u8) } 40 // binary-search lower bound: 'e' lands at estate (index 6) 41 let lb: i64=vr_prefix_lower(V, N, "e\x00" as *u8, 1) 42 pg_puts(" lower('e') idx=" as *u8); pg_pn(lb); pg_puts(" -> " as *u8); pg_putt(V[lb] as *u8); pg_puts(" (exp estate@6) " as *u8) 43 total=total+1; if lb==6 { pass=pass+1; pg_puts("PASS\n" as *u8) } else { pg_puts("FAIL\n" as *u8) } 44 45 pg_puts("----\nPREFIX gate " as *u8); pg_pn(pass); pg_puts("/" as *u8); pg_pn(total); pg_puts(" passed\n" as *u8) 46 pg_puts("HONEST: O(log n + k) via binary-search lower bound on a sorted vocab = instant at scale. Production\n" as *u8) 47 pg_puts(" wires this to the live index vocab for as-you-type suggestions.\n" as *u8) 48 let lg: i64=sys_openat_append("knowledge/status/prefix_gate.log" as *u8, 0x1a4) 49 if lg>=0 { pg_w(lg, "R-UX-3 prefix gate pass=" as *u8); pg_wn(lg, pass); pg_w(lg, "/" as *u8); pg_wn(lg, total); if pass==total { pg_w(lg, " GREEN\n" as *u8) } else { pg_w(lg, " RED\n" as *u8) } sys_close(lg) } 50 if pass==total { pg_puts("R-UX-3 GREEN (sovereign prefix autocomplete proven)\n" as *u8); sys_exit(0); return 0 } 51 pg_puts("R-UX-3 RED\n" as *u8); sys_exit(1); return 1 52}