if (operator == FilterCriteria.CONTAINS) {
return new SearchKey(SearchKey.BCC, criteria.getPatternString());
} else {
// contains not
return new SearchKey(SearchKey.NOT, new SearchKey(
SearchKey.BCC, criteria.getPatternString()));
}
if (operator == FilterCriteria.CONTAINS) {
return new SearchKey(SearchKey.TO, criteria.getPatternString());
} else {
// contains not
return new SearchKey(SearchKey.NOT, new SearchKey(SearchKey.TO,
criteria.getPatternString()));
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/imap/IMAPServer.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/imap/IMAPServer.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (operator == FilterCriteria.CONTAINS) {↵ | | 1 | if (operator == FilterCriteria.CONTAINS) {↵
|
2 | return new SearchKey(SearchKey.BCC, criteria.getPatternString());↵ | | 2 | return new SearchKey(SearchKey.TO, criteria.getPatternString());↵
|
3 | } else {↵ | | 3 | } else {↵
|
4 | // contains not↵ | | 4 | // contains not↵
|
5 | return new SearchKey(SearchKey.NOT, new SearchKey(↵ | | 5 | return new SearchKey(SearchKey.NOT, new SearchKey(↵
|
6 | SearchKey.BCC, ↵ | | 6 | SearchKey.TO,↵
|
7 | criteria.getPatternString()));↵ | | 7 | criteria.getPatternString()));↵
|
8 | } | | 8 | }
|
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.0 |
Clones location | |
Number of node comparisons | 0 |