code wiki / _hdl_build / nx_atlas_recombine.nx
nx_atlas_recombine.nx
buildroot/runtime/_hdl_build/nx_atlas_recombine.nx
about
nx_atlas_recombine.nx -- F225: PRODUCT-recombination over the LIVE atlas (ecograph_full). v2.
Walks the whole 16k-node import graph: ranks INTEGRATIVE nodes by fan-out (Ce = capabilities composed),
FILTERS OUT test/gate/probe/bench scaffolding (not products), then for each real integrative node emits its
single BEST orthogonal partner (no direct edge, low shared-deps) = a diverse, one-per-anchor set of novel
recombination candidates, scored by combined-capability minus shared-overlap. HONEST: STRUCTURAL candidates
(novelty=graph-orthogonality, value=capability-richness), NOT semantic products -- semantic/market rank is
the next rung (match dmktneeds- + a judge). Scale-aware: top-K by Ce, then per-node best-partner scan.
v2 emits to stdout; persist to recombine- + diversify-partner + product-filter refine = follow-ons. seq66
dup-edges inflate Ce (flagged). usage: nx_atlas_recombine [store-prefix] [ce-min] [topK] license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_eco_graph.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 RC_TOPK_MAX: i64 = 96 |
| 14 | const RC_CEMIN_DEF: i64 = 8 |
| 15 | const RC_TOPK_DEF: i64 = 60 |
functions
| 17 | func rc_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 } |
| 18 | func rc_wn(fd: i64, v: i64) -> i64 { let b: *u8 = sys_mmap(24); var m: i64 = v; if m < 0 { sys_write(fd, "-" as *u8, 1); m = 0 - m } let t: *u8 = sys_mmap(24); 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 j: i64 = 0; while j < k { b[j] = t[k-1-j]; j = j + 1 } sys_write(fd, b, k); return 0 } |
| 19 | func rc_wname(fd: i64, g: *EcoGraph, idx: i64) -> i64 |
| 28 | func rc_atoi(s: *u8) -> i64 { var v: i64 = 0; var i: i64 = 0; while s[i] != (0 as u8) { let c: i64 = s[i]; if c >= 48 { if c <= 57 { v = v*10 + (c-48) } } i = i + 1 } return v } called by 1: main |
| 29 | func rc_name_has(g: *EcoGraph, idx: i64, sub: *u8) -> i64 called by 1: rc_is_scaffold |
| 46 | func rc_is_scaffold(g: *EcoGraph, idx: i64) -> i64 |
| 53 | func rc_imports(g: *EcoGraph, a: i64, b: i64) -> i64 called by 1: main |
| 60 | func rc_shared(g: *EcoGraph, a: i64, b: i64) -> i64 called by 1: main |
| 76 | func main(argc: i64, argv: *i64) -> i64 |