def bq.run

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

import Base

81# f halvings, then lo
82def bq.run(f: Nat, +d: Nat, +l: List<&2, U32>, +lo: U32, +hi: U32, +key: U32) -> U32:
83  match f:
84    case 0n:
85      lo
86    case 1n+g:
87      bq.run(g, d, l, bq.nlo(d, l, lo, hi, key), bq.nhi(d, l, lo, hi, key), key)