for (int i = 0; i < list.length; i++) {
File file = list[i];
File renamedFile;
String name = file.getName();
int index = name.indexOf("header");
if (index == -1) {
if ((file.exists()) && (file.length() > 0)) {
renamedFile = new File(file.getParentFile(),
file.getName() + '~');
file.renameTo(renamedFile);
v.add(renamedFile);
}
} else {
// header file found
headerFile.delete();
}
}
if (keyList.size() == 0) {
return getHeaderList().get(uid).getHeader();
} else {
// We need to parse
// get message with UID
IColumbaMessage message = getMessage(uid);
Header header = message.getHeader().getHeader();
Header subHeader = new Header();
String value;
for (int i = 0; i < keys.length; i++) {
value = header.get(keys[i]);
if (value != null) {
subHeader.set(keys[i], value);
}
}
return subHeader;
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/folder/ContactItemCacheStorageImpl.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/AbstractLocalFolder.java
|
Method name: void initCache()
|
|
Method name: Header getHeaderFields(Object, String[])
|
Number of AST nodes: 11
|
|
Number of AST nodes: 11
|
|
1 | for (int i = 0; i < list.length; i++) {↵ | | 1 | if (keyList.size() == 0↵
|
2 | File file = list[i];↵ | | |
|
3 | File renamedFile;↵ | | |
|
4 | String name = file.getName(↵ | | 2 | ) {↵
|
| | | 3 | return getHeaderList().get(uid).getHeader();↵
|
| | | 4 | } else {↵
|
| | | 5 | // We need to parse↵
|
| | | 6 | // get message with UID↵
|
5 | );↵ | | 7 | IColumbaMessage message = getMessage(uid);↵
|
|
6 | int index = name.indexOf("header");↵ | | 8 | Header header = message.getHeader().getHeader();↵
|
|
7 | if (index == -1) {↵ | | 9 | Header subHeader =↵
|
|
8 | if ((file.exists()) && (file.length() > 0)) {↵ | | |
|
9 | renamedFile = new File(file.getParentFile(),↵ | | |
|
10 | file.getName() + '~');↵ | | |
|
11 | file.renameTo(renamedFile);↵ | | |
|
|
12 | v.add(renamedFil↵ | | 10 | new Header();↵
|
| | | 11 | String value;↵
|
|
| | | 12 | for (int i = 0; i < keys.length; i++) {↵
|
| | | 13 | value = header.get(keys[i]);↵
|
|
| | | 14 | if (value != null) {↵
|
13 | e);↵ | | 15 | subHeader.set(keys[i], value);↵
|
14 | }↵ | | 16 | }↵
|
|
15 | } else {↵ | | 17 | }↵
|
16 | // header file found↵ | | |
|
17 | headerFile.delete();↵ | | |
|
18 | }↵ | | |
|
|
| | | 18 | return subHeader;↵
|
19 | } | | 19 | }
|
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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |