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] == IStoreListener.class) {
((IStoreListener) listeners[i + 1]).itemChanged(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]).folderAdded(e);
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/store/AbstractCalendarStore.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/AbstractFolder.java
|
Method name: void fireItemChanged(Object)
|
|
Method name: void fireFolderAdded(IMailFolder)
|
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] == IStoreListener.class) {↵ | | 5 | if (listeners[i] == IFolderListener.class) {↵
|
6 | ((IStoreListener) listeners[i + 1]).itemChanged(e);↵ | | 6 | ((IFolderListener) listeners[i + 1]).folderAdded(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.5 |
Clones location | Clones are in different classes |
Number of node comparisons | 6 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 1.1 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | Object[] listeners = listenerList.getListenerList(); | | 2 | Object[] listeners = listenerList.getListenerList(); |
3 | for (int i = listeners.length - 2; i >= 0; i -= 2) | | 3 | for (int i = listeners.length - 2; i >= 0; i -= 2) |
4 | if (listeners[i] == IStoreListener.class) | | 4 | if (listeners[i] == IFolderListener.class) |
| | | 5 | ((IFolderListener)listeners[i + 1]).folderAdded(e); |
5 | ((IStoreListener)listeners[i + 1]).itemChanged(e); | | | |
Precondition Violations (3)
Row |
Violation |
1 | Unmatched statement ((IFolderListener)listeners[i + 1]).folderAdded(e); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement ((IStoreListener)listeners[i + 1]).itemChanged(e); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
3 | Clone fragment #1 returns variables listeners, i , while Clone fragment #2 returns variables listeners, i |