for (int j = 0; j < parserCount; j++) {
if (parser[j].clock(c)) {
result.append(parser[j].getValue());
}
}
for (int i = 0; i < capabilities.length; i++) {
if (capabilities[i].startsWith(command)) {
list.add(capabilities[i]);
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/print/cPrintVariable.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/imap/IMAPServer.java
|
Method name: String processCodeString()
|
|
Method name: String[] getCapas(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int j = 0; j < parserCount; j++) {↵ | | 1 | for (int i = 0; i < capabilities.length; i++) {↵
|
2 | if (parser[j].clock(c)) {↵ | | 2 | if (↵
|
3 | result.append(parser[j].getValue());↵ | | |
|
4 | }↵ | | |
|
5 | ↵ | | 3 | capabilities[i].startsWith(command)) {↵
|
| | | 4 | list.add(capabilities[i]);↵
|
| | | 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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |