for (int i = 0; i < files.length; i++) {
if (checkDirectory(files[i])) {
list.add(files[i]);
}
}
for (int i = 0; i < uids.length; i++) {
if (exists(uids[i])) {
markMessage(uids[i], variant);
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/plugin/PluginFinder.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/AbstractMessageFolder.java
|
Method name: File[] filterDirectories(File[])
|
|
Method name: void markMessage(Object[], int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < files.length; i++) {↵ | | 1 | for (int i = 0; i < uids.length; i++) {↵
|
2 | if (checkDirectory(files[i])) {↵ | | |
|
3 | list.add(files[i]);↵ | | |
|
4 | }↵ | | |
|
5 | ↵ | | 2 | if (exists(uids[i])) {↵
|
| | | 3 | markMessage(uids[i], variant);↵
|
|
| | | 4 | }↵
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |