law put_dec_view_t

lawful-fields@0.1.1.0 · proof_digits.bend:762

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

762law put_dec_view_t:
763  for +len: U32
764  for +t: P.Tree<U32>
765  for +d: Nat
766  for +n: U32
767  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
768  for +hc: {Nat.is_le(Nat.add(D.size(C.BT(len, t)), 10n), D.cap(C.BT(len, t))) == True{} : Bool}
769  {D.view(FC.put_dec(C.BT(len, t), n)) == List.append(&2, U32, D.view(C.BT(len, t)), F.show(n)) : List<&2, U32>}