Each child node under this node typically represents a table lookup. The implementation 'hops' from the first child to the next recursively for each row returned by a child.
It passes a 'prototype' row (prefillPath) to each new child which contains the current partial event set.
|
|
|
|