law set_view_t
lawful-bytes@0.1.1.0 · proof_ops.bend:87
import lawful-bytes@0.1.1.0/proof_ops.bend as ProofOps
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
87law set_view_t:
88 for +len: U32
89 for +t: P.Tree<U32>
90 for +d: Nat
91 for +i: U32
92 for +v: U32
93 for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
94 for +hi: {Nat.is_lt(U32.to_nat(i), D.size(C.BT(len, t))) == True{} : Bool}
95 for +hv: {U32.is_lt(v, 256) == True{} : Bool}
96 {D.view(B.set(C.BT(len, t), i, v)) == List.set(&2, U32, D.view(C.BT(len, t)), U32.to_nat(i), v) : List<&2, U32>}