code wiki / (root) / nx_swcompare_compute.nx

nx_swcompare_compute.nx

buildroot/runtime/nx_swcompare_compute.nx

19821 B220 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic swcompare

docs dependencies structs consts functions

about

nx_swcompare_compute.nx -- MEASURED, LIAR-KILLED SoftwareCompare of the NISHI computational-math stack vs the state of the art (Wolfram Language / Mathematica, SymPy, SageMath, Maxima). Each NISHI cell is PROVEN by reading the REAL organ source on disk: the implementing symbol must EXIST. Competitor cells = documented capability presence, grounded in knowledge/compare/compute-bar.txt (cited). Coverage is a CAPABILITY-PRESENCE fraction, NOT a depth-parity score -- Wolfram LEADS depth in nearly every category; our EXCEEDS are ONLY the two sovereignty/ determinism axes. Two modes: default (no arg) = console census + liar-kill (the gate, exits 0/1); argv[1]="html" = emit the SoftwareCompare page to stdout (the published nishifamily.com/compare artifact -- a sovereign generator, not a hand-authored page). NOTE: no '#' or '!' in string literals (nx_cc lexer trap) -> rgb() colors + the DOCTYPE '!' is emitted as a byte. 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

11	const K_MAGIC_262144: i64 = 262144

functions

13	func 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 5: wn con_row td_badge html_row main calls 1: sys_write
14	func wc(fd: i64, code: i64) -> i64 { let t: *u8 = sys_mmap(2); t[0] = code as u8; sys_write(fd, t, 1); return 0 } called by 1: main calls 2: sys_mmap sys_write
15	func wn(fd: i64, v: i64) -> i64 called by 1: main calls 3: w sys_mmap sys_write
21	func c_read(path: u8, buf: u8, cap: i64) -> i64 called by 1: c_file_has calls 3: sys_openat_rd sys_read sys_close
27	func c_exists(path: *u8) -> i64 { let fd: i64 = sys_openat_rd(path); if fd < 0 { return 0 } sys_close(fd); return 1 } called by 1: main calls 2: sys_openat_rd sys_close
28	func c_has(buf: u8, n: i64, needle: u8) -> i64 called by 1: c_file_has
35	func c_file_has(path: u8, needle: u8, buf: *u8, cap: i64) -> i64 called by 1: main calls 2: c_read c_has
39	func 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: main
41	func isp(ns: i64) -> i64 { if ns == 1 { return 1 } return 0 } called by 1: main
42	func ise(ns: i64) -> i64 { if ns == 2 { return 1 } return 0 } called by 1: main
43	func isa(ns: i64) -> i64 { if ns == 0 { return 1 } return 0 } called by 1: main
45	func con_row(label: *u8, ns: i64) -> i64 called by 1: main calls 1: w
51	func td_badge(fd: i64, code: i64) -> i64 called by 1: html_row calls 1: w
57	func html_row(fd: i64, cat: u8, ns: i64, wo: i64, sy: i64, sg: i64, mx: i64, note: u8) -> i64 called by 1: main calls 2: w td_badge
65	func main(argc: i64, argv: *i64) -> i64 calls 13: sys_mmap c_file_has c_exists isp ise isa+7