for(int i=0; i < headerTransArray.length; i++) { if(headerTransArray[i].equalsIgnoreCase(n)) { return i+1; } }
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/sampler/AjpSampler.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
Method name: int translateHeader(String) Method name: void addNode(Object, HashTree)
Number of AST nodes: 3 Number of AST nodes: 3
1
for(int i=0; i < headerTransArray.length; i++) {
2
            if(headerTransArray[i].equalsIgnoreCase(n)
1
result = subTree.getTree(target);
3
) {
2
			if (result != null) {
4
                return i+1;
3
			    
5
            }
6
        
4
// short circuit traversal when found
5
				throw new RuntimeException(FOUND);
7
}
6
			}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1