def lc.tab.path

bend-osdev-legacy-ciphers@0.1.0.0 · legacy_ciphers.bend:303

import Base

303# the bits of i (below 2^d) that pick its entry, most significant first
304def lc.tab.path(d: Nat, +i: U32) -> List<&2, Bool>:
305  match d:
306    case 0n:
307      Nil{}
308    case 1n+(+p):
309      Con{U32.is_eq(lc.bit(i, p), 1), lc.tab.path(p, i)}