nx_classical_unpatented_2.nx
buildroot/runtime/nx_classical_unpatented_2.nx
about
nx_classical_unpatented_2.nx -- 8 more classical unpatented algorithms.
Batch 2 of the "all non-patented open algorithms" sweep, all in pure
nishi-lang, all older than any plausible patent.
dependencies 3 imports · 6 importers
imports: nx_syscalls.nxnx_tier.nxnx_bits.nx
imported by: nx_classical_unpatented_2_test.nxnx_math_games.nxnx_notebook_demo.nxnx_proofs_comprehensive.nxnx_triangulation_classical.nxnx_triangulation_number_theory.nx
structs
| none |
consts
| none |
functions
| 22 | func nx_clz_64(x: nx_int) -> nx_int |
| 30 | func nx_ctz_64(x: nx_int) -> nx_int |
| 38 | func nx_reverse_bits_64(x: nx_int) -> nx_int called by 1: main |
| 56 | func nx_horner_eval(coeffs: *nx_int, n: nx_idx, x: nx_int) -> nx_int called by 1: main |
| 75 | func nx_welford_m2(arr: *nx_int, n: nx_idx) -> nx_int called by 1: main |
| 104 | func nx_extended_gcd(a: nx_int, b: nx_int, out_x: *nx_int, out_y: *nx_int) -> nx_int called by 1: main |
| 130 | func nx_mod_pow(base: nx_int, exp: nx_int, m: nx_int) -> nx_int |
| 151 | func nx_is_prime_trial(n: nx_int) -> nx_int |