//******************************************************************
/// <summary>
/// Moves the CurrentParseTreeNode forward in the parse tree, until
/// the sub-tree dominated by this node matches the pattern
/// dominated by FindPatternRoot. If CurrentParseTreeNode is null
/// when this method is called, the search starts with the first
/// node in the parse tree. Otherwise, the search continues with the
/// next node in the tree. If a matching sub-tree is found, true is
/// returned and the MatchingNodes stack contains the list of
/// matching node pairs. If no match is found, CurrentParseTreeNode
/// is set to null and false is returned.
/// </summary>
public bool FindNextMatchingBranch()
{
FindAlgorithm oAlgorithm = new FindAlgorithm(this);
return oAlgorithm.FindNextMatchingBranch();
}
//******************************************************************
#region [FindNextMatchingBranch() Method]
//******************************************************************
/// <summary>
/// Moves the CurrentParseTreeNode forward in the parse tree, until
/// the sub-tree dominated by this node matches the pattern
/// dominated by FindPatternRoot. If CurrentParseTreeNode is null
/// when this method is called, the search starts with the first
/// node in the parse tree. Otherwise, the search continues with the
/// next node in the tree. If a matching sub-tree is found, true is
/// returned and the MatchingNodes stack contains the list of
/// matching node pairs. If no match is found, CurrentParseTreeNode
/// is set to null and false is returned.
/// </summary>
public bool FindNextMatchingBranch()
{
FindAlgorithm oAlgorithm = new FindAlgorithm(this);
return(oAlgorithm.FindNextMatchingBranch());
}
