code wiki / _hdl_build / nx_engineer_wire_test.nx
nx_engineer_wire_test.nx
buildroot/runtime/_hdl_build/nx_engineer_wire_test.nx
about
nx_engineer_wire_test.nx -- the ENGINEER wires the BM25 ranker into the library search and CERTIFIES
the swap before it is accepted. It runs the OLD ranker (ls_best, TF-IDF) and the NEW one
(ls_best_bm25) over a labelled query set, then checks non-regression + improvement:
Q1 "injury" (length-bias) ground-truth = doc0 (short focused). old TF-IDF picks doc1 (diluted, WRONG);
BM25 picks doc0 (RIGHT) -> an improvement.
Q2 "court" ground-truth = doc3. both rankers pick doc3 -> no regression.
Verdict must be WIRED_OK (0 regressions, >=1 improvement). It also proves the gate REJECTS a regressing
swap. Exit 0 on 6/6. license_tier: ORIGINAL
dependencies 4 imports · 0 importers
imports: nx_engineer_wire.nxnx_library_search.nxnx_research_extract.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
| 15 | func wt_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 16 | func wt_num(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 } |
| 18 | func main() -> i64 |