def AW

lawful-bytes@0.1.1.0 · proof_fast_find.bend:464

import Base
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

464def AW(+t: P.Tree<U32>, +wi: U32, +o: Nat) -> List<&2, U32>:
465  List.drop(&2, U32, C.L4(C.WD(t, wi)), o)