synchronized(testTree) {
testTree.traverse(compiler);
testTree.traverse(new TurnElementsOn());
testTree.traverse(testListeners);
testTree.traverse(sampleListeners);
}
while (it.hasNext()) {
Object temp = it.next();
data.put(temp, new ListedHashTree());
order.add(temp);
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/engine/ClientJMeterEngine.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/ListedHashTree.java
|
Method name: void run()
|
|
Method name: void ListedHashTree(Collection)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | synchronized(testTree) {↵ | | |
|
2 | testTree.traverse(compiler);↵ | | |
|
3 | testTree.traverse(new TurnElementsOn());↵ | | |
|
4 | testTree.traverse(testListeners);↵ | | |
|
5 | testTree.traverse(sampleListeners↵ | | 1 | while (it.hasNext()) {↵
|
| | | 2 | Object temp = it.next();↵
|
| | | 3 | data.put(temp, new ListedHashTree());↵
|
6 | );↵ | | 4 | order.add(temp);↵
|
7 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |