for (int counter = 0; counter < order.length; counter++) { TestElement sampler = test.next(); assertNotNull(sampler); assertEquals("Counter: " + counter, order[counter], sampler.getName()); }
while (iter.hasNext()) { Object item = iter.next(); add(item); getTree(item).add(newTree.getTree(item)); }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/test/src/org/apache/jmeter/control/TestThroughputController.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
Method name: void testByNumber() Method name: void add(HashTree)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int counter = 0; counter < order.length; counter++) {
2
				TestElement sampler
1
while (iter.hasNext()) {
3
 = test.next();
2
			Object item = iter.next();
4
				assertNotNull(sampler);
3
			a
5
				assertEquals("Counter: " + counter, order[counter], sampler.getName(
4
dd(item);
6
));
5
			getTree(item).add(newTree.getTree(item));
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.0
Clones locationClones are in different classes
Number of node comparisons1