while (it.hasNext()) { Object temp = it.next(); data.put(temp, new ListedHashTree()); order.add(temp); }
for (int counter = 0; counter < order.length; counter++) { TestElement sampler = test.next(); assertNotNull(sampler); assertEquals("Counter: " + counter, order[counter], sampler.getName()); }
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/test/src/org/apache/jmeter/control/TestThroughputController.java
Method name: void ListedHashTree(Collection) Method name: void testByNumber()
Number of AST nodes: 4 Number of AST nodes: 4
1
while (it.hasNext()) {
2
			Object temp = it.next();
3
			data.put(temp, new ListedHashTree());
4
			order.add(temp
1
for (int counter = 0; counter < order.length; counter++) {
2
				TestElement sampler = test.next();
3
				assertNotNull(sampler);
5
);
4
				assertEquals("Counter: " + counter, order[counter], sampler.getName());
6
		}
5
			}
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