arundel.core

Interface Gate

All Known Implementing Classes:

Operator, Placeholder, Variable

public interface Gate

A Gate is the basic building block for the computational directed acyclic graph (DAG). A gate has certain inputs, it can perform some computation on these inputs and produces some outputs as a result of this computation, which in turn maybe the inputs for some other Gates.

Method Summary

Modifier and Type	Method and Description
void	backward() Method to compute the backward computation for this gate.
void	forward() Method to compute the forward computation for this gate.
java.util.List<Link>	inputs() Returns the list of input links (incoming edges) for this Gate.
java.util.List<Link>	outputs() Returns the list of output links (outgoing edges) for this Gate.
void	update() Update the parmameters of this gate on the basis of backward computation.

Method Detail

forward

void forward()

Method to compute the forward computation for this gate.

backward

void backward()

Method to compute the backward computation for this gate.

update

void update()

Update the parmameters of this gate on the basis of backward computation.

inputs

java.util.List<Link> inputs()

Returns the list of input links (incoming edges) for this Gate.

Returns:

a List of Links, null if no inputs

outputs

java.util.List<Link> outputs()

Returns the list of output links (outgoing edges) for this Gate.

Returns:

a List of Links