def BW

lawful-bytes@0.1.1.0 · proof_fast_find.bend:467

import Base
import lawful-arrays@0.1.0.0/proof_tree.bend as P

467def BW(+t: P.Tree<U32>, +wi: U32) -> List<&2, U32>:
468  List.drop(&2, U32, UB(t), Nat.mul(Nat.add(U32.to_nat(wi), 1n), 4n))