if (!m_isLong) {
if (0 == peekAtChar()) {
getChar();
}
}
for (int i = 0; i < subNodes.length; i++) {
HashTree t = generateNode(subNodes[i]);
if (t != null) {
subTree.add(element, t);
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/commons/cli/avalon/CLArgsParser.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/save/OldSaveService.java
|
Method name: void parseArguments()
|
|
Method name: HashTree generateNode(Configuration)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | if (!m_isLong) {↵ | | |
|
2 | if (0 == peekAtChar()) {↵ | | |
|
3 | getChar(↵ | | 1 | for (int i = 0; i < subNodes.length; i++) {↵
|
| | | 2 | HashTree t = generateNode(subNodes[i]);↵
|
|
| | | 3 | if (t != null) {↵
|
4 | );↵ | | 4 | subTree.add(element, t);↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 6 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |