code wiki / _hdl_build / nx_assignments_run.nx
nx_assignments_run.nx
buildroot/runtime/_hdl_build/nx_assignments_run.nx
about
nx_assignments_run.nx -- the TEAM prioritizes the andelinwest S-class assignments from its OWN measured
signals (NOT scores Claude typed -- the anti-cheat applied to prioritization) and begins the top; Claude
just watches + tutors the blocked ones (operator: "the team needs to prioritize and then work... we just
watch and tutor"). GROUNDED inputs:
READY[i] = does the team already OWN the capability to start NOW (no novel authoring / no network gate)?
-- derived from the registry, not opinion.
VALUE[i] = how many flagged S-class blockers it closes (countable from the PM review log).
EFFORT[i] = build-units.
Eligible = READY; ranked by VALUE/EFFORT (WSJF). BLOCKED items go to the tutor, not the bottom of a queue.
license_tier: ORIGINAL Composes nx_pm_decision_matrix + nx_work_dispatcher.
dependencies 4 imports · 0 importers
imports: nx_pm_decision_matrix.nxnx_work_dispatcher.nxnx_pm_review_log.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
| none |
functions
| 17 | func ar_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 18 | func ar_num(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48;k=1}; while m>0{t[k]=48+(m%10);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 } |
| 20 | func main() -> i64 |