nx_peptide_denovo_test.nx
buildroot/runtime/nx_peptide_denovo_test.nx
about
nx_peptide_denovo_test.nx -- gate for de novo sequencing. The liar-kill is
the ROUND TRIP (T1): take a known peptide, generate its real b-ion ladder,
de novo sequence it back with NO knowledge of the answer, and recover the
original sequence. If any residue-mass gap were wrong, a letter would be
wrong. Bradykinin (no Leu/Ile) gives an EXACT recovery; angiotensin
documents the honest Leu/Ile ambiguity.
expect_exit: 0 license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_peptide.nxnx_peptide_denovo.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
| none |
functions
| 12 | func t_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 13 | func t_putn(v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64 = v; if m < 0 { m = 0 - m; sys_write(1, "-" as *u8, 1) } let t: *u8 = sys_mmap(28); var k: i64 = 0; if m == 0 { t[0] = 48 as u8; k = 1 } while m > 0 { t[k] = (48 + (m % 10)) as u8; m = m / 10; k = k + 1 } var i: i64 = 0; while i < k { bb[i] = t[k - 1 - i]; i = i + 1 } sys_write(1, bb, k); return 0 } |
| 15 | func t_streq(a: *u8, b: *u8) -> i64 { var i: i64 = 0; while 1 == 1 { if a[i] != b[i] { return 0 } if a[i] == (0 as u8) { return 1 } i = i + 1 } return 1 } called by 1: main |
| 18 | func build_b_ladder(seq: *u8, out: *i64) -> i64 |
| 28 | func main() -> i64 |