private ProgressNode FindOldestLeafmostNodeHelper(List <ProgressNode> treeToSearch, out List <ProgressNode> listWhereFound, out int indexWhereFound) { listWhereFound = null; indexWhereFound = -1; FindOldestNodeVisitor v = new FindOldestNodeVisitor(); NodeVisitor.VisitNodes(treeToSearch, v); listWhereFound = v.ListWhereFound; indexWhereFound = v.IndexWhereFound; return(v.FoundNode); }
FindOldestLeafmostNodeHelper(ArrayList treeToSearch, out ArrayList listWhereFound, out int indexWhereFound) { listWhereFound = null; indexWhereFound = -1; FindOldestNodeVisitor v = new FindOldestNodeVisitor(); NodeVisitor.VisitNodes(treeToSearch, v); listWhereFound = v.ListWhereFound; indexWhereFound = v.IndexWhereFound; #if DEBUG || ASSERTIONS_TRACE if (v.FoundNode == null) { Dbg.Assert(listWhereFound == null, "list should be null when no node found"); Dbg.Assert(indexWhereFound == -1, "index should indicate no node found"); Dbg.Assert(_topLevelNodes.Count == 0, "if there is no oldest node, then the tree must be empty"); Dbg.Assert(_nodeCount == 0, "if there is no oldest node, then the tree must be empty"); } #endif return(v.FoundNode); }
FindOldestLeafmostNodeHelper(ArrayList treeToSearch, out ArrayList listWhereFound, out int indexWhereFound) { listWhereFound = null; indexWhereFound = -1; FindOldestNodeVisitor v = new FindOldestNodeVisitor(); NodeVisitor.VisitNodes(treeToSearch, v); listWhereFound = v.ListWhereFound; indexWhereFound = v.IndexWhereFound; #if DEBUG || ASSERTIONS_TRACE if (v.FoundNode == null) { Dbg.Assert(listWhereFound == null, "list should be null when no node found"); Dbg.Assert(indexWhereFound == -1, "index should indicate no node found"); Dbg.Assert(_topLevelNodes.Count == 0, "if there is no oldest node, then the tree must be empty"); Dbg.Assert(_nodeCount == 0, "if there is no oldest node, then the tree must be empty"); } #endif return v.FoundNode; }