Maybe automatically forward() an eager node at the time of its construction.
If we assume inductively that it's inputs are eager (which should be necessary for its eagerness), then they should already be forwarded, therefore we can forward the downstream node safely without running any graph traversal.
Notion of eagerness can be derived automatically by eagerness of all inputs, similar to how devices can be derived from input node devices based on precedence.
Maybe automatically
forward()an eager node at the time of its construction.If we assume inductively that it's inputs are eager (which should be necessary for its eagerness), then they should already be
forwarded, therefore we canforwardthe downstream node safely without running any graph traversal.Notion of eagerness can be derived automatically by eagerness of all inputs, similar to how devices can be derived from input node devices based on precedence.