def MatT.matmul

bend-tensors@0.0.0.2 · bend_tensors.bend:888

import Base

888# a * b: MatT(r, k) times MatT(k, c) is MatT(r, c). For two square
889# operands of one depth, MatT.matmul.sq is the same recursion with one
890# depth riding instead of three, and 3x faster per node; a runtime
891# dispatch to it is not possible without a cast, and any def that returns
892# or rebuilds a MatT parameter makes the compiler reference-count every
893# MatT node in the program (see AGENTS.md), so the choice is the caller's.
894def MatT.matmul(+r: Nat, +k: Nat, +c: Nat, +a: MatT(r, k), +b: MatT(k, c)) -> MatT(r, c):
895  MatT.matmul.any(r, k, c, a, b)