Bsearch.bsearch.array.advance: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/bsearch.bend as Bsearch
Lines 101-105 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=101&end_line=105

import Base

def bsearch.array.advance(st: BsearchState, +key: U32) -> BsearchState:
  match st:
    case BsearchState{a, +lo, +hi}:
      +mid = U32.add(lo, U32.shr(U32.sub(hi, lo)))
      bsearch.array.step(U32.is_lt(lo, hi), Array.get(U32, a, mid), key, lo, hi, mid)

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.get
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.shr
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.sub
  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.step