while (it.hasNext()) { Object temp = it.next(); data.put(temp, new ListedHashTree()); order.add(temp); }
while (iter.hasNext()) { Object temp = iter.next(); tree.add(temp); tree = tree.getTree(temp); }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/ListedHashTree.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
Method name: void ListedHashTree(Collection) Method name: HashTree addTreePath(Collection)
Number of AST nodes: 4 Number of AST nodes: 4
1
while (it.hasNext()) {
1
while (iter.hasNext()) {
2
			Object temp = it.next();
2
			Object temp = iter.next();
3
			data.put(temp, new ListedHashTree());
3
			
4
			order.add
4
tree.add(temp);
5
(temp);
5
			tree = tree.getTree(temp);
6
		}
6
		}
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes having the same super class
Number of node comparisons16
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements2
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)6.3
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    4
    while (it.hasNext())
    4
    while (it.hasNext())
    3
    while (iter.hasNext())
    Differences
    Expression1Expression2Difference
    ititerVARIABLE_NAME_MISMATCH
    3
    while (iter.hasNext())
    5
    Object temp = it.next();
    5
    Object temp = it.next();
    4
    Object temp = iter.next();
    Differences
    Expression1Expression2Difference
    ititerVARIABLE_NAME_MISMATCH
    4
    Object temp = iter.next();
                                        
    5
    tree.add(temp);
    Preondition Violations
    Unmatched statement tree.add(temp); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    5
    tree.add(temp);
                                                          
    6
    tree = tree.getTree(temp);
    Preondition Violations
    Unmatched statement tree=tree.getTree(temp); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    6
    tree = tree.getTree(temp);
    6
    data.put(temp, new ListedHashTree());
    6
    data.put(temp, new ListedHashTree());
    Preondition Violations
    Unmatched statement data.put(temp,new ListedHashTree()); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                                                  
    7
    order.add(temp);
    7
    order.add(temp);
    Preondition Violations
    Unmatched statement order.add(temp); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                          
    Precondition Violations (4)
    Row Violation
    1Unmatched statement tree.add(temp); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    2Unmatched statement tree=tree.getTree(temp); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    3Unmatched statement data.put(temp,new ListedHashTree()); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    4Unmatched statement order.add(temp); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted