Decides whether a node's join is satisfied — i.e. whether it may start.
A node with no incoming edges is always ready; that is what makes an entry point an entry point.
Unsatisfiable predecessors do not block forever. Under 'all', a predecessor that failed, or
that can no longer be reached because every path to it was rejected, would otherwise hold the join
open for the life of the graph. additionalSettledNodeIds lets the caller declare those settled-
and-not-coming rather than pending. Without it the AND-join is a deadlock waiting for a branch
that was never taken — exactly the stall the durable executor exists to detect, and cheaper not
to create than to detect.
Decides whether a node's join is satisfied — i.e. whether it may start.
A node with no incoming edges is always ready; that is what makes an entry point an entry point.
Unsatisfiable predecessors do not block forever. Under
'all', a predecessor that failed, or that can no longer be reached because every path to it was rejected, would otherwise hold the join open for the life of the graph.additionalSettledNodeIdslets the caller declare those settled- and-not-coming rather than pending. Without it the AND-join is a deadlock waiting for a branch that was never taken — exactly the stall the durable executor exists to detect, and cheaper not to create than to detect.