ProofGrow.gtree: def of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_grow.bend as ProofGrow
Lines 239-245 of lawful-bytes@0.1.1.0/proof_grow.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_grow.bend&start_line=239&end_line=245

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

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

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.add
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_index.bend&name=set_tree
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Tree
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_core.bend&name=WD