public class SceneVisitor
Thetype exposes the following members.
Returns the currently visited component during a traversal.
Returns currently visited node during a traversal.
Gets a value indicating whether the current enumeration should yield.
Can be called in derived visitors. Set this property to true during traversals to make the visitor yield the current component when used as an enumerator.
Can be called in derived visitors. Set this property to true during traversals to make the visitor yield the current node when used as an enumerator.
Enumerator Building Block to be called in derived Visitors acting as enumerators. Use this to initialize the traversing enumeration on a list of (root) nodes.
This method implements a re-entrant (in terms of yield, not multi-threading) non-recursive traversal over combined node and component trees. Call this method in derived classes implementing enumerators, like in the various find extension methods or the ViseratorTItem, TState
Determines whether the specified object is equal to the current object.(Inherited from Object.)
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.(Inherited from Object.)
Serves as the default hash function.(Inherited from Object.)
Gets the Type of the current instance.(Inherited from Object.)
Method is called when traversal starts to initialize the traversal state. Override this method in derived classes to initialize any state.
Creates a shallow copy of the current Object.(Inherited from Object.)
Method is called when going up one hierarchy level while traversing. Override this method to perform pop on any self-defined state.
Method is called when going down one hierarchy level while traversing. Override this method to push any self-defined state.
Returns a string that represents the current object.(Inherited from Object.)
Start traversing a scene graph starting with the given root node. Performs a recursive depth-first traversal from the speciefiedd root.
Start traversing a list of nodes. Performs a recursive depth-first traversal over the list starting with the first node in the list.