Bsearch.bsearch.array.go: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/bsearch.bend as Bsearch
Lines 112-119 of bend-osdev-algo@0.1.0.0/bsearch.bend: https://jend.leeeet.dev/read.txt?path=bend-osdev-algo@0.1.0.0/bsearch.bend&start_line=112&end_line=119

import Base

# fuel bounds the halvings: 33 is enough for any [lo, hi) of U32; once the
# range is empty the remaining steps change nothing
def bsearch.array.go(fuel: Nat, st: BsearchState, +key: U32) -> Array<U32> & U32:
  match fuel:
    case 0n:
      bsearch.array.result(st)
    case 1n+f:
      bsearch.array.go(f, bsearch.array.advance(st, key), key)

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bsearch.bend&name=BsearchState
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bsearch.bend&name=bsearch.array.advance
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bsearch.bend&name=bsearch.array.result