706                 }
 707             }   // for
 708         }
 709 
 710         // if still not found, check the list which was specified to be checked
 711         // last, this is just a performance optimization
 712         if (result[0] == -1 && lastListToCheck >= 0) {
 713             int possible = testLists[lastListToCheck].indexOf(tr);
 714             if (possible != -1) {
 715                 result[0] = lastListToCheck;
 716                 result[1] = possible;
 717             }
 718         }
 719 
 720         return result;
 721     }
 722 
 723     /**
 724      * Determine the index of a particular test in a vector.
 725      */
 726     private int searchList(TestResult target, Vector list) {
 727         int possible = list.indexOf(target);
 728         return possible;
 729     }
 730 
 731     private void cleanup() {
 732         if (state == ABORTED) {
 733             // no valid info
 734             return;
 735         }
 736 
 737         state = COMPLETED;
 738     }
 739 
 740     /**
 741      * Prepare to process this node.
 742      * Avoid calling until it is time to process the node.
 743      * @return Iterator for this node, or null if not possible.
 744      */
 745     private TestResultTable.TreeIterator init() {
 746         if (node == null) {

 706                 }
 707             }   // for
 708         }
 709 
 710         // if still not found, check the list which was specified to be checked
 711         // last, this is just a performance optimization
 712         if (result[0] == -1 && lastListToCheck >= 0) {
 713             int possible = testLists[lastListToCheck].indexOf(tr);
 714             if (possible != -1) {
 715                 result[0] = lastListToCheck;
 716                 result[1] = possible;
 717             }
 718         }
 719 
 720         return result;
 721     }
 722 
 723     /**
 724      * Determine the index of a particular test in a vector.
 725      */
 726     private int searchList(TestResult target, Vector<?> list) {
 727         int possible = list.indexOf(target);
 728         return possible;
 729     }
 730 
 731     private void cleanup() {
 732         if (state == ABORTED) {
 733             // no valid info
 734             return;
 735         }
 736 
 737         state = COMPLETED;
 738     }
 739 
 740     /**
 741      * Prepare to process this node.
 742      * Avoid calling until it is time to process the node.
 743      * @return Iterator for this node, or null if not possible.
 744      */
 745     private TestResultTable.TreeIterator init() {
 746         if (node == null) {