law find_view_t

lawful-bytes@0.1.1.0 · proof_find.bend:333

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/bytes.bend as B
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

333law find_view_t:
334  for +len: U32
335  for +t: P.Tree<U32>
336  for +d: Nat
337  for +from: U32
338  for +to: U32
339  for +c: U32
340  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
341  for +hft: {U32.is_le(from, to) == True{} : Bool}
342  for +ht: {Nat.is_le(U32.to_nat(to), D.size(C.BT(len, t))) == True{} : Bool}
343  for +hc: {U32.is_lt(c, 256) == True{} : Bool}
344  {U32.to_nat(Pair.snd(D.Bytes, U32, B.find(C.BT(len, t), from, to, c))) == D.first(D.view(C.BT(len, t)), U32.to_nat(from), U32.to_nat(to), c) : Nat}