def tnew

lawful-bytes@0.1.1.0 · proof_grow.bend:18

import Base
import lawful-arrays@0.1.0.0/proof_tree.bend as P

18# A new block as a tree.
19def tnew(+d: Nat, +v: U32) -> P.Tree<U32>:
20  match d:
21    case 0n:
22      P.TLeaf{v}
23    case 1n+p:
24      P.TNode{tnew(p, v), tnew(p, v)}