nx_blockmax_wand_gate.nx
buildroot/runtime/nx_blockmax_wand_gate.nx
about
nx_blockmax_wand_gate.nx -- proves block-max pruning returns the EXACT top-k as exhaustive scoring while SCORING
FEWER docs. Fixture: 3 query terms, per-(term,doc) impacts; k=3. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_blockmax_wand.nxnx_gate.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
| 6 | func gwf(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} if fd>=0 { sys_write(fd,s,n) } return 0 } called by 1: main |
| 7 | func g_sort_desc(a: *i64, n: i64) -> i64 { var i: i64=0; while i<n { var j: i64=0; while j<n-1 { if a[j]<a[j+1] { let t: i64=a[j]; a[j]=a[j+1]; a[j+1]=t } j=j+1 } i=i+1 } return 0 } called by 1: main |
| 8 | func g_sort_asc(a: *i64, n: i64) -> i64 { var i: i64=0; while i<n { var j: i64=0; while j<n-1 { if a[j]>a[j+1] { let t: i64=a[j]; a[j]=a[j+1]; a[j+1]=t } j=j+1 } i=i+1 } return 0 } called by 1: main |
| 9 | func g_eq(a: *i64, b: *i64, n: i64) -> i64 { var i: i64=0; while i<n { if a[i]!=b[i] { return 0 } i=i+1 } return 1 } called by 1: main |
| 11 | func main() -> i64 |