Bsearch.bsearch.find: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/bsearch.bend as Bsearch
Lines 65-68 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=65&end_line=68

import Base

# an index of a sorted list that holds key (the first), or None
def bsearch.find(+xs: List<&2, U32>, +key: U32) -> Maybe<&2, Nat>:
  +i = bsearch.lower_bound(xs, key)
  bsearch.find.check(i, List.get(&2, U32, xs, i), key)

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.get
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  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=bsearch.find.check
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bsearch.bend&name=bsearch.lower_bound