ProofFastFind.UB: def of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_fast_find.bend as ProofFastFind
Lines 456-459 of lawful-bytes@0.1.1.0/proof_fast_find.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_fast_find.bend&start_line=456&end_line=459

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

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

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Tree
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/defs.bend&name=unpack
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_core.bend&name=WL