code wiki / _hdl_build / nx_search_inverted_persist_test.nx
nx_search_inverted_persist_test.nx
buildroot/runtime/_hdl_build/nx_search_inverted_persist_test.nx
about
nx_search_inverted_persist_test.nx -- proves the inverted-index disk persistence round-trips: build an index
from a real seed corpus (seed/object_specs.jsonl), query a term, SAVE to disk, LOAD back, query the same term,
and verify identical n_rows + postings_count + query_hash. This is the S-class STORAGE rung: build once over a
corpus, persist, query forever (no re-tokenize). Exit 0 iff the loaded index returns identical results.
dependencies 1 imports · 0 importers
imports: nx_search_inverted_persist.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
| 7 | func sp(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 1: main |
| 8 | 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;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 } called by 1: main |
| 10 | func main() -> i64 |