law array_lower_bound_list

bend-osdev-algo@0.1.0.0 · LAWS.bend:279

import Base
import bend-osdev-array@0.1.0.0/array.bend as AR
import bend-osdev-algo@0.1.0.0/bsearch.bend as S

279law array_lower_bound_list:
280  for +d: Nat
281  for a: Array<U32>
282  for hp: {AR.Arrays.is_perfect(U32, d, a) == True{} : Bool}
283  for hd: {Nat.is_lt(d, 32n) == True{} : Bool}
284  for n: U32
285  for hn: {Nat.is_le(U32.to_nat(n), AR.Arrays.slots(d)) == True{} : Bool}
286  for key: U32
287  for hs: {S.bsearch.sorted(List.take(&2, U32, AR.Arrays.leaves(U32, a), U32.to_nat(n))) == True{} : Bool}
288  {U32.to_nat(Pair.snd(Array<U32>, U32, S.bsearch.array_lower_bound(a, n, key))) == S.bsearch.lower_bound(List.take(&2, U32, AR.Arrays.leaves(U32, a), U32.to_nat(n)), key) : Nat}