def UB

lawful-bytes@0.1.1.0 · proof_fast_find.bend:456

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

456# All the block's bytes, the start of a search inside word wi (o bytes in),
457# the rest of that word, and the bytes from the next word on.
458def UB(+t: P.Tree<U32>) -> List<&2, U32>:
459  D.unpack(C.WL(t))