code wiki / _hdl_build / nx_vec_nsw_gate.nx
nx_vec_nsw_gate.nx
buildroot/runtime/_hdl_build/nx_vec_nsw_gate.nx
about
nx_vec_nsw_gate.nx -- KAT for R-VEC-3 (nx_vec_nsw): the NSW graph search returns the TRUE nearest neighbor
(recall@1 = brute force) even when the search STARTS FAR from the answer -- that is the ef-beam working.
8 vectors spread by angle; cosine = nearness. expect_exit: 0 license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_vec_kernel.nxnx_vec_nsw.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
| 8 | func ng_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 9 | func ng_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 } |
| 10 | func ng_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 } |
| 11 | func ng_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 } |
| 14 | func brute_nn(V: *i64, N: i64, D: i64, query: *i64) -> i64 |
| 19 | func setv(V: *i64, idx: i64, x: i64, y: i64) -> i64 { V[idx*2]=x; V[idx*2+1]=y; return 0 } called by 1: main |
| 21 | func main() -> i64 |