TreeTraversalServiceDepthFirstPreOrder(IInternalElementContainer, PredicateInternalElementType) Method

A DepthFirst (Pre-Order) Traversal algorithm, which can be used to traverse an InstanceHierarchy tree in pre order via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection.

Namespace: Aml.Engine.Services.TreeTraversal
Assembly: Aml.Engine.Services.TreeTraversal (in Aml.Engine.Services.TreeTraversal.dll) Version: 2.0

Syntax

C++

Copy

public IEnumerable<IInternalElementContainer> DepthFirstPreOrder(
	IInternalElementContainer root,
	Predicate<InternalElementType> condition = null
)

Public Function DepthFirstPreOrder ( 
	root As IInternalElementContainer,
	Optional condition As Predicate(Of InternalElementType) = Nothing
) As IEnumerable(Of IInternalElementContainer)

public:
virtual IEnumerable<IInternalElementContainer^>^ DepthFirstPreOrder(
	IInternalElementContainer^ root, 
	Predicate<InternalElementType^>^ condition = nullptr
) sealed

Parameters

root IInternalElementContainer: The root defines the InstanceHierarchy which is used as the starting point of the traversal.
condition PredicateInternalElementType (Optional): The selection predicate.

Return Value

IEnumerableIInternalElementContainer
ordered enumeration of all InternalElements in the tree in pre order.

Implements

ITreeTraversalServiceDepthFirstPreOrder(IInternalElementContainer, PredicateInternalElementType)

Reference

TreeTraversalService Class

DepthFirstPreOrder Overload

Aml.Engine.Services.TreeTraversal Namespace