def wired
import bendtorch-core@0.1.0.0/src/autograd/backward.bend as Backwardimport Base
187def wired(nodes: List<&2, Node>, +count: Nat) -> Bool:
188 match nodes count:
189 case Nil{} count:
190 True{}
191 case Con{node, rest} 0n:
192 False{}
193 case Con{node, rest} 1n+below:
194 Bool.and(operands_below(node, below), wired(rest, below))
Uses (6)
Used by (8)
- bendtorch-core@0.1.0.0/src/autograd/backward:planned
- bendtorch-core@0.1.0.0/src/autograd/backward_PROOF:wired_entries
- bendtorch-core@0.1.0.0/src/autograd/backward_LAWS:backward_dangling
- bendtorch-core@0.1.0.0/src/autograd/backward_LAWS:backward_success
- bendtorch-core@0.1.0.0/src/autograd/backward_LAWS:wired_matches_operand_bounds
- …