def bsearch.array_lower_bound

bend-osdev-algo@0.1.0.0 · bsearch.bend:121

import Base

121# the index of the first of the first n elements not below key (n if none)
122def bsearch.array_lower_bound(a: Array<U32>, n: U32, key: U32) -> Array<U32> & U32:
123  bsearch.array.go(33n, BsearchState{a, 0, n}, key)