code wiki / _hdl_build / nx_editdist_gate.nx

nx_editdist_gate.nx

buildroot/runtime/_hdl_build/nx_editdist_gate.nx

3370 B46 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_editdist_gate.nx -- KATs for the bounded Levenshtein (the typo rung's math floor). license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_editdist.nx nx_gate_verdict.nx nx_editdist_gate.nx

imports: nx_editdist.nxnx_gate_verdict.nx

imported by: nobody (leaf or entry point)

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

main gv_ctr sys_mmap nxa_die sys_write sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ gv_head gv_puts sys_write ↻ g_check gv_check gv_puts ↻ g_ed ed_bounded sys_mmap ↻ g_len ed_bounded ↻ gv_verdict gv_note_bare_rate gv_bare_rate gv_at gv_obj_has_n gv_at ↻ gv_puts ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap gv_puts ↻

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 }
13func g_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 1: g_ed
14func g_num(v: i64) -> i64
23func g_ed(a: *u8, b: *u8, bound: i64) -> i64 { return ed_bounded(a, g_len(a), b, g_len(b), bound) }
called by 1: main calls 2: ed_boundedg_len
25func g_check(name: *u8, cond: i64, ctr: *i64) -> i64 { return gv_check(name, cond, ctr) }
called by 1: main calls 1: gv_check
27func main() -> i64
calls 6: gv_ctrgv_headg_checkg_eded_boundedgv_verdict