def bq.pre

bend-osdev-algo@0.1.0.0 · proof_bsearch.bend:31

import Base

31# the searched prefix, its lower bound, and the range's size and middle as
32# Nats
33def bq.pre(+l: List<&2, U32>, +n: U32) -> List<&2, U32>:
34  List.take(&2, U32, l, U32.to_nat(n))