VirtualFolder searchFolder = createVirtualFolder(folder);
searchFolder.getFilter().getFilterRule().setCondition(
rule.getConditionInt());
for (int i = 0; i < rule.getChildCount(); i++) {
// add filter criteria
searchFolder.getFilter().getFilterRule().add(rule.get(i));
}
return searchFolder;
VirtualFolder searchFolder = createVirtualFolder(folder);
searchFolder.getFilter().getFilterRule().setCondition(
rule.getConditionInt());
for (int i = 0; i < rule.getChildCount(); i++) {
// add filter criteria
searchFolder.getFilter().getFilterRule().add(rule.get(i));
}
return searchFolder;
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/search/SearchFolderFactory.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/search/SearchFolderFactory.java
|
Method name: VirtualFolder createSearchFolder(FilterRule, IMailFolder)
|
|
Method name: VirtualFolder prepareSearchFolder(FilterRule, IMailFolder)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | VirtualFolder searchFolder = createVirtualFolder(folder);↵ | | 1 | VirtualFolder searchFolder = createVirtualFolder(folder);↵
|
|
2 | searchFolder.getFilter().getFilterRule().setCondition(↵ | | 2 | searchFolder.getFilter().getFilterRule().setCondition(↵
|
3 | rule.getConditionInt());↵ | | 3 | rule.getConditionInt());↵
|
|
4 | for (int i = 0; i < rule.getChildCount(); i++) {↵ | | 4 | for (int i = 0; i < rule.getChildCount(); i++) {↵
|
5 | // add filter criteria↵ | | 5 | // add filter criteria↵
|
6 | searchFolder.getFilter().getFilterRule().add(rule.get(i));↵ | | 6 | searchFolder.getFilter().getFilterRule().add(rule.get(i));↵
|
7 | }↵ | | 7 | }↵
|
|
8 | return searchFolder; | | 8 | return searchFolder;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 13 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | VirtualFolder searchFolder = createVirtualFolder(folder); | | 1 | VirtualFolder searchFolder = createVirtualFolder(folder); |
2 | searchFolder.getFilter().getFilterRule().setCondition(rule.getConditionInt()); | | 2 | searchFolder.getFilter().getFilterRule().setCondition(rule.getConditionInt()); |
3 | for (int i = 0; i < rule.getChildCount(); i++) | | 3 | for (int i = 0; i < rule.getChildCount(); i++) |
4 | searchFolder.getFilter().getFilterRule().add(rule.get(i)); | | 4 | searchFolder.getFilter().getFilterRule().add(rule.get(i)); |
5 | return searchFolder; | | 5 | return searchFolder; |
Precondition Violations (0)
Row |
Violation |