You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Also reworked terminology so that "walk" now refers to what the walker
does to the tree as a whole or to container nodes within it, while
"visit" is used for what happens to each node included in the walk.
The Disposition class for the result of a visit now includes an optional
Callback metnod instance, which will be invoked just prior to finishing
up the visit. This means that the walk method can do something while
visiting a container node and then undo it after all its children have
been visited.
We'll use that for managing a set of references already encountered in
this walk while visiting an ancestor node, in order to support reference
cycle detection.
We need to descend into child nodes of the current node, even if we're
not actually visiting the current node because we're in an anonymous
state. After all, anonymous states appear becuase they're intermediate
states in transits that lead to named nodes, so not descending in this
case could mean failing to visit some nodes corresponding to named states.
Cycles cannot affect component scans
The text was updated successfully, but these errors were encountered: