code wiki / _hdl_build / nx_connect_lds_census.nx
nx_connect_lds_census.nx
buildroot/runtime/_hdl_build/nx_connect_lds_census.nx
about
nx_connect_lds_census.nx -- CONNECT / LDS-COMMUNITY VERTICAL maturity scorecard (honest ratchet).
The LDS community is CONNECT's FIRST launch community (the disciplined cold-start wedge): free
forever, youth-to-adult, worldwide -- so members can catch up with the missionaries who taught
them, returned missionaries can catch up with the members/families they served, and LDS youth
worldwide can meet, play games and hang out SAFELY.
SCOPE BOUNDARY (non-goal, by design): this is COMMUNITY + RECONNECTION + YOUTH BELONGING only --
NEVER congregation administration, NEVER proselytizing, NEVER competes with the Church's own tools.
Same honest idiom as nx_connect_census: one row per (pillar x capability), graded ABSENT->PRESENT->
PARITY->EXCEEDS from EVIDENCE; the gate LIAR-KILLS any PARITY/EXCEEDS lacking a measured head-to-head
(neg-control proves the kill fires). A cell flips to PRESENT only with a PASSING gate, named inline.
PRESENT cells here cite gates verified this session (nx_connect_lds_reconnect 8/8, nx_connect_lds_youth
8/8, nx_connect_csae_report GREEN) or already-proven spine gates (nx_connect_graph/idage/match).
EXCEEDS=0 by design: no self-scored wins -- a measured H2H vs a NAMED incumbent earns those later.
license_tier: ORIGINAL expect_exit: 0
dependencies 1 imports · 0 importers
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
structs
| none |
consts
| 19 | const G_ABSENT: i64 = 0 |
| 20 | const G_PRESENT: i64 = 1 |
| 21 | const G_PARITY: i64 = 2 |
| 22 | const G_EXCEEDS: i64 = 3 |
functions
| 24 | func sw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 25 | func sn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" 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(1,bb,k); return 0 } |
| 27 | func grade_name(g: i64) -> i64 |
| 36 | func cap_valid(grade: i64, has_ev: i64) -> i64 |
| 41 | func row(pillar: *u8, cap: *u8, grade: i64, base: *u8, evidence: *u8, has_ev: i64, tot: *i64) -> i64 |
| 51 | func main() -> i64 |