Check if this
contains node
.
Check if this
contains node
.
Get the number of unique nodes in the circuit that satisfy the filter function.
Get the number of unique nodes in the circuit that satisfy the filter function.
Find the node which has stolen the output of an another node.
Find the node which has stolen the output of an another node.
If the output has been stolen multiple times, it tracks that and returns the final owner. If the output has never been stolen, it simply returns the node.
The node that originally drove the output.
Node that currently drives the output originally driven by originalOwner.
Flatten the circuit to an array.
Flatten the circuit to an array. Default is by postorder traversal.
Flatten the circuit to an array using a preorder traversal.
Flatten the circuit to an array using a preorder traversal.
Inputs to the circuit.
Inputs to the circuit.
Get the leaves (inputs) of the circuit.
Get the leaves (inputs) of the circuit.
Print out a circuit for debugging.
Print out a circuit for debugging.
Get the roots (outputs) of the circuit.
Get the roots (outputs) of the circuit.
Get the number of unique nodes in the circuit.
Get the number of unique nodes in the circuit.
Traverse DAG postorder, executing "f" for each node not already visited.
Traverse DAG postorder, executing "f" for each node not already visited.
Traverse DAG preorder, executing "f" for each node not already visited.
Traverse DAG preorder, executing "f" for each node not already visited.
An optimized computation with a simple interface, primarily intended for writing debuggers. The structure of the circuit can be analyzed using the inherited Circuit methods.
While the KernelCircuit has been moved to the Hypercircuit/Hypernode classes to support multi-output kernels, this class still uses Circuit/Node. Thus, it is not set up yet for probing of multi-output kernels.