code wiki / (root) / nx_idea_tree.nx

nx_idea_tree.nx

buildroot/runtime/nx_idea_tree.nx

6686 B160 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic idea
docsdependenciesstructsconstsfunctions

about

nx_idea_tree.nx -- the ANCESTRY view of the idea genealogy (genealogist criterion 5). Renders, for every idea in idea_genealogy.tsv, its LOGIC-GENEALOGY chain walked UP the descends_from edges to the root insight, plus who/when and the organ it is realized_in. This is the "this idea produced this produced this" view the operator asked for, as the human-readable face of the tree. Iterative (no recursion), cycle-guarded, MEASURED from the real registry only. Output to stdout + append-only knowledge/status/idea_tree.txt. Sovereign syscalls only. module: nishi-core.genealogy.idea_tree depends: nishi-core.genealogy.idea_genealogist capability: GENEALOGY license_tier: ORIGINAL

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_idea_tree.nx

imports: nx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sys_mmap it_load sys_mmap ↻ sys_openat_rd sys_read sys_close it_field_tab sys_openat_append sys_now_realtime_sec sys_mmap ↻ sys_clock_gettime_real it_w sys_write it_wn sys_mmap ↻ sys_write ↻ it_render it_w ↻ it_isdash it_find it_streq sys_close ↻ sys_exit

structs

none

consts

14const IT_MAGIC_1048576: i64 = 1048576
15const IT_MAGIC_1048575: i64 = 1048575
17const IT_IDEA: *u8 = "knowledge/registry/idea_genealogy.tsv"
18const IT_OUT: *u8 = "knowledge/status/idea_tree.txt"
19const IT_CAP: i64 = 256
20const IT_MAX: i64 = 256

functions

22func it_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 2: it_rendermain calls 1: sys_write
23func it_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 as u8;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: main calls 2: sys_mmapsys_write
25func it_streq(a: *u8, b: *u8) -> i64
called by 1: it_find
31func it_field_tab(buf: *u8, ls: i64, n: i64, fidx: i64, out: *u8, outcap: i64) -> i64
called by 1: it_load
59func it_load(path: *u8, aid: i64, awho: i64, awhen: i64, adesc: i64, areal: i64, cap: i64, maxc: i64) -> i64
92func it_find(aid: i64, cnt: i64, cap: i64, name: *u8) -> i64
called by 1: it_render calls 1: it_streq
98func it_isdash(s: *u8) -> i64
called by 1: it_render
105func it_render(fd: i64, i: i64, aid: i64, awho: i64, awhen: i64, adesc: i64, areal: i64, cnt: i64, cap: i64) -> i64
called by 1: main calls 3: it_wit_isdashit_find
133func main() -> i64