code wiki / _hdl_build / nx_nishi_search_census.nx

nx_nishi_search_census.nx

buildroot/runtime/_hdl_build/nx_nishi_search_census.nx

18828 B240 linesdepth 5pulls 9 transitivereach 0 importersview sourcekind tooltopic nishi
docsdependenciesstructsconstsfunctions

about

nx_nishi_search_census.nx -- MEASURED census of NISHI SEARCH vs the banked SOTA bar (operator 2026-07-03: "search that domain + their docs/site, search our nishi library, search the internet -- s class exceed on all fronts"). Grounding = the 11 sources nx_websearch_research banked (BM25/inverted-index/indexing/ crawler/PageRank canon + meilisearch/typesense/searxng/pagefind/stract/marginalia READMEs). NO-FALSE-GREEN discipline: every HAVE row is proven by a LIVE probe against the real shards/gates on this tree (a real dss_search, a real ss_hget, a real banked file) -- never asserted; BEHIND rows are conceded explicitly with the rival that holds the bar. A negative-control probe must FAIL for the census to be GREEN (the prober itself is falsifiable). Score = permille of axes at HAVE-or-AHEAD. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_docportal_search_serve.nx nx_itoa_lib.nx nx_nishi_search_census.nx

imports: nx_docportal_search_serve.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

main c_puts c_exists c_row c_puts ↻ c_q dss_search dss_search_off dss_search_off_div dss_prefix dss_open_maybe_cached dsc_web_prefix_is ss_open dsc_manifest_sig sys_munmap ss_close ss_open2 ss_tok_table ss_tok_next2 ss_u8cp ss_fold_cp ss_fold_word_cp ss_is_cjk dss_streq dss_stem_expand nx_stem dss_tlen ss_term_count ss_term_at dss_streq ↻ sys_munmap ↻ ss_doc_count ss_r32 ss_term_dcount ss_terms_find idf_q10 ilog2_1024 ss_phrase sys_mmap ss_manifest_dyn

structs

none

consts

11const K_MAGIC_4096: i64 = 4096
12const K_MAGIC_40960: i64 = 40960

functions

14func c_puts(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: c_rowmain
15func c_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 4: c_containsc_qc_urlrowmain
20func c_num(v: i64) -> i64 { nxi_out(v); return 0 }
called by 1: main calls 1: nxi_out
21func 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
22func c_contains(hay: *u8, hn: i64, ndl: *u8) -> i64
called by 1: main calls 1: c_len
36func c_q(domain: *u8, term: *u8) -> i64
called by 1: main calls 2: dss_searchc_len
42func c_urlrow(domain: *u8, term: *u8, pfx: *u8) -> i64
called by 1: main calls 5: dss_searchc_lendss_prefixss_openss_hget
66func c_row(name: *u8, verdict: *u8, ok: i64, have: *i64, total: *i64) -> i64
called by 1: main calls 1: c_puts
75func main() -> i64
calls 17: c_putsc_existsc_rowc_qc_urlrowc_contains+11