code wiki / (root) / nx_office_census.nx

nx_office_census.nx

buildroot/runtime/nx_office_census.nx

29391 B262 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind tooltopic office

docs dependencies structs consts functions

about

nx_office_census.nx -- the MEASURED, LIAR-KILLED scoreboard for the NISHI OFFICE SUITE vs the STATE OF THE ART (2025/2026 conferences + industry leaders: Microsoft 365 Copilot, Google Workspace Gemini, LibreOffice 25.x). Operator 2026-07-08: "do we have a SOTA office suite with all the features ... as of conferences from 25/26 and the industry leaders?" -- this organ answers HONESTLY, never self-scored: each cell is PROVEN by reading the REAL organ source on disk. PRESENT requires the implementing symbol to EXIST; ABSENT (the gap) requires it to NOT exist ANYWHERE. EXCEEDS = a capability NO leader (incl. LibreOffice) has, cited. The SOTA feature BAR is grounded in the web-fetched corpus knowledge/library/office-sota-bar-2026-07-08.txt (real 2025/2026 sources). Coverage=(EXCEEDS+PRESENT)/total is a FEATURE-COVERAGE fraction, NOT a "beat everyone" score. A SOTA suite has ~34 major feature areas; scoring LOW is the HONEST outcome for a young sovereign stack -- the point is to NAME the gaps, not flatter. Liar-kill asserts the marquee gaps are REAL + coverage stays honest-low. census-subject: product-surface (the suite has a public UI at nishifamily.com/office -- U-axes mandatory) expect_exit: 0 license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_syscalls.nxnx_itoa_lib.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

15	const K_MAGIC_262144: i64 = 262144

functions

17	func lc_w(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } called by 2: lc_cell main calls 1: sys_write
22	func lc_n(v: i64) -> i64 { nxi_out(v); return 0 } called by 1: main calls 1: nxi_out
23	func lc_read(path: u8, buf: u8, cap: i64) -> i64 called by 1: lc_file_has calls 3: sys_openat_rd sys_read sys_close
29	func lc_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
30	func lc_has(buf: u8, n: i64, needle: u8) -> i64 called by 1: lc_file_has
37	func lc_file_has(path: u8, needle: u8, buf: *u8, cap: i64) -> i64 called by 1: main calls 2: lc_read lc_has
41	func lc_cell(cls: u8, id: u8, txt: *u8) -> i64 { lc_w(" ["); lc_w(cls); lc_w("] "); lc_w(id); lc_w(" "); lc_w(txt); lc_w("\n"); return 0 } called by 1: main calls 1: lc_w
43	func main() -> i64 calls 7: lc_w sys_mmap lc_file_has lc_exists lc_n lc_cell+1