for (int i = 1; i < result.groups(); i++) { value = result.group(i); if (value != null) { break; } }
result = subTree.getTree(target); if (result != null) { // short circuit traversal when found throw new RuntimeException(FOUND); }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/http/modifier/URLRewritingModifier.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
Method name: void process() Method name: void addNode(Object, HashTree)
Number of AST nodes: 4 Number of AST nodes: 3
1
for (int i = 1; i < result.groups(); i++) {
2
					value = result.group(i);
1
result = subTree.getTree(target);
3
					if (value != null) {
2
			if (result != null) {
4
						break;
3
			
5
					}
4
    // short circuit traversal when found
5
				throw new RuntimeException(FOUND);
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.2
Clones locationClones are in different classes
Number of node comparisons5
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements1
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)0.9
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
                                                                        
    1
    result = subTree.getTree(target);
    Preondition Violations
    Unmatched statement result=subTree.getTree(target); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    1
    result = subTree.getTree(target);
    31
    value = result.group(i);
    31
    value = result.group(i);
    Preondition Violations
    Unmatched statement value=result.group(i); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                        
    32
    if (value != null)
    32
    if (value != null)
    2
    if (result != null)
    Differences
    Expression1Expression2Difference
    valueresultVARIABLE_NAME_MISMATCH
    java.lang.Stringorg.apache.jorphan.collections.HashTreeVARIABLE_TYPE_MISMATCH
    Preondition Violations
    Type java.lang.String of variable value does not match with type org.apache.jorphan.collections.HashTree of variable result
    • Make classes java.lang.String and org.apache.jorphan.collections.HashTree extend a common superclass
    2
    if (result != null)
                                                                              
    3
    throw new RuntimeException(FOUND);
    Preondition Violations
    Unmatched statement throw new RuntimeException(FOUND); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted
    Unmatched throw new RuntimeException(FOUND);
    3
    throw new RuntimeException(FOUND);
    33
    break;
    33
    break;
    Preondition Violations
    Unmatched break;
                        
    Precondition Violations (7)
    Row Violation
    1Unmatched statement result=subTree.getTree(target); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    2Unmatched statement value=result.group(i); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    3Type java.lang.String of variable value does not match with type org.apache.jorphan.collections.HashTree of variable result
    4Unmatched statement throw new RuntimeException(FOUND); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted
    5Unmatched throw new RuntimeException(FOUND);
    6Unmatched break;
    7The refactoring of the clones is infeasible, because the number of macthed statements is equal to zero