code wiki / _hdl_build / nx_research_deliver.nx
nx_research_deliver.nx
buildroot/runtime/_hdl_build/nx_research_deliver.nx
about
nx_research_deliver.nx -- close the DELIVERY loop for ONE section (the researcher), honestly. The
researcher does REAL work: a sovereign search over the no-link-rot library (nx_library) for a
topic, producing CID-cited findings. ONLY if real findings exist does it flip its cued task
PENDING->APPLIED in the roles- store (rs_row_set) with a reference to the actual result -- so
`delivering` becomes true because work was COMPLETED, not because a flag was toggled. Re-running
nx_team_harmony then shows researcher PERFORMING (0->1), and nx_critics_review's stars climb. This
is the template every section follows to turn ENGAGED into MUSIC. Sovereign. license_tier: ORIGINAL
dependencies 4 imports · 0 importers
imports: nx_library.nxnx_itoa_lib.nxnx_role_store.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 RD_CHAN: *u8 = "researcherq" |
| 14 | const RD_TOPIC: *u8 = "hydrogen" // a term the sovereign corpus genuinely holds (verified: 4 hits) |
functions
| 16 | func rd_w(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 21 | func rd_n(v: i64) -> i64 { nxi_out(v); return 0 } |
| 22 | func rd_streq(a: *u8, b: *u8) -> i64 { var i: i64 = 0; while a[i] != (0 as u8) { if a[i] != b[i] { return 0 } i = i + 1 } if b[i] != (0 as u8) { return 0 } return 1 } called by 1: rd_find_pending |
| 23 | func rd_cat(dst: *u8, off: i64, s: *u8) -> i64 { var o: i64 = off; var i: i64 = 0; while s[i] != (0 as u8) { dst[o] = s[i]; o = o + 1; i = i + 1 } return o } called by 1: main |
| 24 | func rd_catn(dst: *u8, off: i64, v: i64) -> i64 { var o: i64 = off; if v == 0 { dst[o] = 48 as u8; return o + 1 } var m: i64 = v; let t: *u8 = sys_mmap(24); var k: i64 = 0; while m > 0 { t[k] = (48 + (m % 10)) as u8; m = m / 10; k = k + 1 } var i: i64 = k - 1; while i >= 0 { dst[o] = t[i]; o = o + 1; i = i - 1 } return o } |
| 27 | func rd_find(buf: *u8, n: i64, needle: *u8) -> i64 called by 1: rd_research |
| 41 | func rd_research(topic: *u8, first_cid: *u8) -> i64 |
| 61 | func rd_find_pending(channel: *u8) -> i64 |
| 73 | func main(argc: i64, argv: *i64) -> i64 |