law fview2_go

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:640

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

640law fview2_go:
641  for +b: Bool
642  for +len: U32
643  for +t: P.Tree<U32>
644  for +d: Nat
645  for +from: U32
646  for +to: U32
647  for +c1: U32
648  for +c2: U32
649  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
650  for +hft: {U32.is_le(from, to) == True{} : Bool}
651  for +ht: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
652  for +hc1: {U32.is_lt(c1, 256) == True{} : Bool}
653  for +hc2: {U32.is_lt(c2, 256) == True{} : Bool}
654  for +hb: {U32.is_le(to, from) == b : Bool}
655  {U32.to_nat(U32.min(FG2(Bool.pick(Nat, b, 0n, U32.to_nat(((((to - 1 : U32) >> 2n : U32) - (from >> 2n : U32) : U32) + 1 : U32))), U32.is_zero(M02(t, from, FA.rep(c1), FA.rep(c2))), (from >> 2n : U32), M02(t, from, FA.rep(c1), FA.rep(c2)), FA.rep(c1), FA.rep(c2), t), to)) == D.first2(D.view(C.BT(len, t)), U32.to_nat(from), U32.to_nat(to), c1, c2) : Nat}