boolean isMoveMessageWhenMarkingEnabled() {
return getBooleanWithDefault("move_message_when_marking", false);
}
public void enableMoveMessageWhenMarking(boolean enabled) {
setBoolean("move_message_when_marking", enabled);
}
public boolean isMoveTrashSelected() {
return getBooleanWithDefault("move_trash", true);
}
boolean isEnabled() {
return getBooleanWithDefault("enabled", false);
}
/**
* Enable/Disable spam filter.
*
* @param enabled true or false
*/
public void setEnabled(boolean enabled) {
setBoolean("enabled", enabled);
}
public boolean isMoveIncomingJunkMessagesEnabled() {
return getBooleanWithDefault("move_incoming_junk_messages", false);
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/config/SpamItem.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/config/SpamItem.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | boolean isMoveMessageWhenMarkingEnabled() {↵ | | 1 | boolean isEnabled() {↵
|
2 | return getBooleanWithDefault("move_message_when_marking", false);↵ | | 2 | return getBooleanWithDefault("enabled", false);↵
|
3 | }↵ | | 3 | }↵
|
4 | ↵ | | 4 | ↵
|
| | | 5 | /**↵
|
| | | 6 | * Enable/Disable spam filter.↵
|
| | | 7 | * ↵
|
| | | 8 | * @param enabled true or false↵
|
| | | 9 | */↵
|
5 | public void enableMoveMessageWhenMarking(boolean enabled) {↵ | | 10 | public void setEnabled(boolean enabled) {↵
|
6 | setBoolean("move_message_when_marking", enabled);↵ | | 11 | setBoolean("enabled", enabled);↵
|
| | | 12 | ↵
|
7 | }↵ | | 13 | }↵
|
8 | ↵ | | 14 | ↵
|
9 | public boolean isMoveTrashSelected() {↵ | | 15 | public boolean isMoveIncomingJunkMessagesEnabled() {↵
|
10 | return getBooleanWithDefault("move_trash", true);↵ | | 16 | return getBooleanWithDefault("move_incoming_junk_messages", false);↵
|
11 | } | | 17 | }
|
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 |