def b_tree

bendtorch@1.3.0.0 · PROOF.bend:691

import Base
import bendtorch@1.3.0.0/main.bend as T
import bend-ml-tensor-array@0.1.18.0/main.bend as TA

691def b_tree(d: Nat, gs: T.Halves<T.BG>, +n: Nat, +h: Nat, +dm: T.Dm) -> b_MR<d, gs, n, h, dm>:
692  match d gs:
693    case 0n T.Halves{l, r}:
694      b_m0a(l, r, n, h, dm, b_l1(l, h, dm, Nil{}))
695    case 1n++e T.Halves{l, r}:
696      b_m1a(e, l, r, n, h, dm, b_cg(TA.half(TA.half(n)), l, Nil{}), b_cg(TA.half(Nat.sub(n, TA.half(n))), r, Nil{}), g1 => b_tree(e, g1, TA.half(n), h, dm), g2 => b_tree(e, g2, Nat.sub(n, TA.half(n)), h, dm))