def trep

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/array.bend:79

import Base

79def trep(-T: Data, +d: Nat, +v: T) -> Tree<T>:
80  match d:
81    case 0n:
82      TLeaf{v}
83    case 1n+p:
84      TNode{trep(T, p, v), trep(T, p, v)}