Object[] listeners = listenerList.getListenerList();
// Process the listeners last to first, notifying
// those that are interested in this event
for (int i = listeners.length - 2; i >= 0; i -= 2) {
if (listeners[i] == IFolderListener.class) {
((IFolderListener) listeners[i + 1]).messageAdded(e);
}
}
Object[] listeners = listenerList.getListenerList();
// Process the listeners last to first, notifying
// those that are interested in this event
for (int i = listeners.length - 2; i >= 0; i -= 2) {
if (listeners[i] == IFolderListener.class) {
((IFolderListener) listeners[i + 1]).messageRemoved(e);
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/AbstractMessageFolder.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/AbstractMessageFolder.java
|
Method name: void fireMessageAdded(Object, Flags)
|
|
Method name: void fireMessageRemoved(Object, Flags)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | Object[] listeners = listenerList.getListenerList();↵ | | 1 | Object[] listeners = listenerList.getListenerList();↵
|
|
2 | // Process the listeners last to first, notifying↵ | | 2 | // Process the listeners last to first, notifying↵
|
3 | // those that are interested in this event↵ | | 3 | // those that are interested in this event↵
|
4 | for (int i = listeners.length - 2; i >= 0; i -= 2) {↵ | | 4 | for (int i = listeners.length - 2; i >= 0; i -= 2) {↵
|
5 | if (listeners[i] == IFolderListener.class) {↵ | | 5 | if (listeners[i] == IFolderListener.class) {↵
|
6 | ((IFolderListener) listeners[i + 1]).messageAdded(e);↵ | | 6 | ((IFolderListener) listeners[i + 1]).messageRemoved(e);↵
|
7 | }↵ | | 7 | }↵
|
8 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 6 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 4 |
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) | 0.9 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | Object[] listeners = listenerList.getListenerList(); | | 11 | Object[] listeners = listenerList.getListenerList(); |
11 | for (int i = listeners.length - 2; i >= 0; i -= 2) | | 12 | for (int i = listeners.length - 2; i >= 0; i -= 2) |
12 | if (listeners[i] == IFolderListener.class) | | 13 | if (listeners[i] == IFolderListener.class) |
13 | ((IFolderListener)listeners[i + 1]).messageAdded(e); | | 14 | ((IFolderListener)listeners[i + 1]).messageRemoved(e); |
Precondition Violations (4)
Row |
Violation |
1 | Expression ((IFolderListener)listeners[i + 1]).messageAdded(e) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression ((IFolderListener)listeners[i + 1]).messageRemoved(e) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Expression ((IFolderListener)listeners[i + 1]).messageAdded(e) is a void method call, and thus it cannot be parameterized |
4 | Expression ((IFolderListener)listeners[i + 1]).messageRemoved(e) is a void method call, and thus it cannot be parameterized |