code wiki / _hdl_build / nx_site_search_gate.nx

nx_site_search_gate.nx

buildroot/runtime/_hdl_build/nx_site_search_gate.nx

7222 B105 linesdepth 6pulls 6 transitivereach 0 importersview sourcekind gate/prooftopic site
docsdependenciesstructsconstsfunctions

about

nx_site_search_gate.nx -- MEASURED gate for the live /search endpoint handler (nx_site_search). Self-contained: builds a small PERSISTED onsite index + manifest (the 4 andelinwest practice areas) in-process, then drives the pure handler sr_handle with crafted GET /search?q=... requests and asserts the rendered results page: T1 q=divorce -> 200, links /practice/family-law ("Family Law"), 1 result T2 q=will -> Estate Planning (/practice/estate-planning) T3 q=zzznomatch-> 0 results (graceful) T4 q=divorce+injury -> 2 results (family-law + personal-injury), multi-term union T5 the search form echoes the query back (sticky input) GREEN iff 5/5. Appends knowledge/status/site_search_gate.log. license_tier: ORIGINAL

dependencies 1 imports · 0 importers

nx_site_search.nx nx_site_search_gate.nx

imports: nx_site_search.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main g_puts nx_inv_new_sized nx_inv_index_row nx_inv_is_token_char nx_inv_hash_bytes_lower nx_inv_add_posting nx_inv_count_token nx_inv_slot_at nx_inv_slot_hash nx_inv_slot_set_hash nx_inv_slot_set_postings_c nx_inv_slot_postings_count g_slen nx_inv_finalize_offsets nx_inv_slot_at ↻ nx_inv_slot_hash ↻ nx_inv_slot_postings_count ↻ nx_inv_slot_set_postings_o nx_inv_slot_set_write_curs nx_inv_emit_row nx_inv_is_token_char ↻ nx_inv_hash_bytes_lower ↻ nx_inv_emit_posting nx_inv_slot_at ↻ nx_inv_slot_hash ↻ nx_inv_slot_postings_count ↻ nx_inv_slot_postings_offse nx_inv_slot_write_cursor nx_inv_slot_set_write_curs ↻ nx_inv_save sys_openat_wr nx_invp_write_all sys_openat_wr ↻ g_w g_num sys_openat_append g_wn

structs

none

consts

none

functions

12func g_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 1: main
13func g_num(v: i64) -> i64
called by 1: main
19func g_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 1: main
20func g_wn(fd: i64, v: i64) -> i64
called by 1: main
26func g_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 2: g_containsmain
27func g_contains(hay: *u8, n: i64, ndl: *u8) -> i64
calls 1: g_slen
33func g_mkreq(out: *u8, s: *u8) -> i64 { var o: i64 = 0; while s[o] != (0 as u8) { out[o] = s[o]; o = o + 1 } return o }
35func main() -> i64