law array_find_list

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

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

299law array_find_list:
300  for +d: Nat
301  for a: Array<U32>
302  for hp: {AR.Arrays.is_perfect(U32, d, a) == True{} : Bool}
303  for hd: {Nat.is_lt(d, 32n) == True{} : Bool}
304  for n: U32
305  for hn: {Nat.is_le(U32.to_nat(n), AR.Arrays.slots(d)) == True{} : Bool}
306  for key: U32
307  for hs: {S.bsearch.sorted(List.take(&2, U32, AR.Arrays.leaves(U32, a), U32.to_nat(n))) == True{} : Bool}
308  {algo_index_nat(Pair.snd(Array<U32>, Maybe<&2, U32>, S.bsearch.array_find(a, n, key))) == S.bsearch.find(List.take(&2, U32, AR.Arrays.leaves(U32, a), U32.to_nat(n)), key) : Maybe<&2, Nat>}