while (iter.hasNext()) {
Object temp = iter.next();
tree.add(temp);
tree = tree.getTree(temp);
}
if (logFile != null) {
ResultCollector logger = new ResultCollector();
logger.setFilename(logFile);
tree.add(tree.getArray()[0], logger);
}
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/JMeter.java
|
Method name: HashTree addTreePath(Collection)
|
|
Method name: void run(String, String, boolean, String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | while (iter.hasNext()) {↵ | | |
|
2 | Object temp = iter.next↵ | | 1 | if (logFile != null) {↵
|
3 | ();↵ | | 2 | ResultCollector logger = new ResultCollector();↵
|
4 | tree.add(temp);↵ | | 3 | logger.setFilename(logFile);↵
|
5 | tree = tree.getTree(temp);↵ | | 4 | tree.add(tree.getArray()[0], logger);↵
|
6 | } | | 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 |