code wiki / _hdl_build / nx_treegen_gate.nx
nx_treegen_gate.nx
buildroot/runtime/_hdl_build/nx_treegen_gate.nx
about
nx_treegen_gate.nx -- prove SOVEREIGN INFINIGEN vegetation: seeds grow distinct procedural TREES.
T1 a tree generates a reasonable part count (trunk + branches + leaf clusters) and renders (trunk + canopy)
T2 ★VARIETY: different seeds -> different trees (part counts differ AND render L1 large)
T3 determinism + gallery PNG knowledge/nx_treegen.png (3 trees)
license_tier: ORIGINAL expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_png.nxnx_treegen.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
| 10 | func hw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 11 | func pn(v: i64) -> i64 { let b: *u8=sys_mmap(32) as *u8; var x: i64=v; var ng: i64=0; if x<0{ng=1;x=0-x} var i: i64=31; if x==0{b[i]=48 as u8;i=i-1} while x>0{b[i]=(48+x%10) as u8;x=x/10;i=i-1} if ng==1{b[i]=45 as u8;i=i-1} sys_write(1,(b as i64+i+1) as *u8,31-i); return 0 } |
| 12 | func lum(px: i64) -> i64 { return (px&255)+((px>>8)&255)+((px>>16)&255) } |
| 13 | func L1(a: *i64, b: *i64, n: i64) -> i64 { var s: i64=0; var i: i64=0; while i<n { var d: i64=(a[i]&255)-(b[i]&255); if d<0{d=0-d} s=s+d; i=i+1 } return s } called by 1: main |
| 15 | func main() -> i64 |