result = subTree.getTree(target); if (result != null) { // short circuit traversal when found throw new RuntimeException(FOUND); }
for (int i=0;i<nonProxyHostSuffixSize;i++){ if (host.endsWith((String)nonProxyHostSuffix.get(i))) { return true; } }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/http/sampler/HTTPSampler2.java
Method name: void addNode(Object, HashTree) Method name: boolean isPartialMatch(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
result = subTree.getTree(target);
2
			if (result != null
1
for (int i=0;i<nonProxyHostSuffixSize;i++){
3
) {
2
            if (host.endsWith((String)nonProxyHostSuffix.get(i))) {
4
			    // short circuit traversal when found
3
    
5
				throw new RuntimeException(FOUND);
6
			
4
            return true;
5
            }
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