Iterator iter = list().iterator();
while (iter.hasNext()) {
Object item = iter.next();
visitor.addNode(item, getTree(item));
getTree(item).traverseInto(visitor);
}
Iterator iter = list().iterator();
while (iter.hasNext()) {
Object item = iter.next();
visitor.addNode(item, getTree(item));
getTree(item).traverseInto(visitor);
}
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/jorphan/collections/HashTree.java
|
Method name: void traverse(HashTreeTraverser)
|
|
Method name: void traverseInto(HashTreeTraverser)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | Iterator iter = list().iterator();↵ | | 1 | Iterator iter = list().iterator();↵
|
2 | while (iter.hasNext()) {↵ | | 2 | while (iter.hasNext()) {↵
|
3 | Object item = iter.next();↵ | | 3 | Object item = iter.next();↵
|
4 | visitor.addNode(item, getTree(item));↵ | | 4 | visitor.addNode(item, getTree(item));↵
|
5 | getTree(item).traverseInto(visitor);↵ | | 5 | getTree(item).traverseInto(visitor);↵
|
6 | } | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 17 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 52.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Iterator iter = list().iterator(); | | 3 | Iterator iter = list().iterator(); |
2 | while (iter.hasNext()) | | 4 | while (iter.hasNext()) |
3 | Object item = iter.next(); | | 5 | Object item = iter.next(); |
4 | visitor.addNode(item, getTree(item)); | | 6 | visitor.addNode(item, getTree(item)); |
5 | getTree(item).traverseInto(visitor); | | 7 | getTree(item).traverseInto(visitor); |
Precondition Violations (0)
Row |
Violation |