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

import Base

# an index of the first n elements of a sorted array that holds key, or None
def bsearch.array_find(a: Array<U32>, +n: U32, +key: U32) -> Array<U32> & Maybe<&2, U32>:
  bsearch.array.find(bsearch.array_lower_bound(a, n, key), n, key)

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  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=bsearch.array.find
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bsearch.bend&name=bsearch.array_lower_bound