def gtree

lawful-bytes@0.1.1.0 · proof_grow.bend:239

import Base
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P
import lawful-arrays@0.1.0.0/proof_index.bend as I

239# The tree grow.go builds from td: words i .. i+n-1 of t written in.
240def gtree(n: Nat, +t: P.Tree<U32>, +td: P.Tree<U32>, +i: U32) -> P.Tree<U32>:
241  match n:
242    case 0n:
243      td
244    case 1n+k:
245      gtree(k, t, I.set_tree(U32, td, i, C.WD(t, i)), (i + 1 : U32))