code wiki / _hdl_build / nx_cms_search_gate.nx
nx_cms_search_gate.nx
buildroot/runtime/_hdl_build/nx_cms_search_gate.nx
about
nx_cms_search_gate.nx -- CMS SITE-SEARCH gate (W-RE: land a missing class HONESTLY). The team's BM25
(nx_bm25) is proven to beat FTS5; this gates it AS A CMS CAPABILITY: ranked retrieval over the
andelinwest practice corpus, 3 queries must each land the RIGHT page. Writes the gated evidence
(CMSGATE ... site-search ... verdict=PASS) to knowledge/status/cms_gate.log ONLY on a genuine 3/3 --
so nx_cms_census flips site-search PRESENT on real evidence, never a fake-green. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_bm25.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
| 9 | func sg_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 10 | func sg_len(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 11 | func sg_num(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(1,bb,k); return 0 } |
| 13 | func main() -> i64 |