code wiki / _hdl_build / nx_geo_join_gate.nx

nx_geo_join_gate.nx

buildroot/runtime/_hdl_build/nx_geo_join_gate.nx

2927 B67 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic geo

docs dependencies structs consts functions

about

nx_geo_join_gate.nx -- GATE for GEO-013 spatial join. Pool of 2 disjoint squares (A near origin, B far away) + 4 query points. Proves each point joins to the correct polygon (exact, deterministic): Q0 center of A -> 0 Q1 center of B -> 1 Q2 between, outside -> -1 Q3 inside A by edge -> 0 Evidence -> knowledge/status/geo_join.log (GEOJOINGATE authored=organ ... verdict=GREEN). license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_geo_join.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

13	const GJN_LOG: *u8 = "knowledge/status/geo_join.log"

functions

15	func gjn_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 } called by 1: gjn_emit calls 1: sys_write
16	func gjn_wn(fd: i64, v: i64) -> i64 { let bb: u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" 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)) 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 } called by 1: gjn_emit calls 2: sys_mmap sys_write
18	func gjn_set(p: i64, i: i64, lat: i64, lon: i64) -> i64 { p[i 2] = lat; p[i * 2 + 1] = lon; return 0 } called by 1: main
20	func gjn_emit(fd: i64, j0: i64, j1: i64, j2: i64, j3: i64, ok: i64) -> i64 called by 1: main calls 2: gjn_w gjn_wn
29	func main() -> i64 calls 6: sys_mmap gjn_set geo_spatial_join gjn_emit sys_openat_append sys_close