law push_view_t

lawful-bytes@0.1.1.0 · proof_ops.bend:159

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

159law push_view_t:
160  for +len: U32
161  for +t: P.Tree<U32>
162  for +d: Nat
163  for +v: U32
164  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
165  for +hc: {Nat.is_lt(D.size(C.BT(len, t)), D.cap(C.BT(len, t))) == True{} : Bool}
166  for +hv: {U32.is_lt(v, 256) == True{} : Bool}
167  {D.view(B.push(C.BT(len, t), v)) == List.append(&2, U32, D.view(C.BT(len, t)), [v]) : List<&2, U32>}