for (int i = listenerList.length - 2; i >= 0; i -= 2) {
if (listenerList[i] == SeriesChangeListener.class) {
((SeriesChangeListener) listenerList[i + 1]).seriesChanged(
event);
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/general/AbstractDataset.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/general/Series.java
|
Method name: void notifyListeners(DatasetChangeEvent)
|
|
Method name: void notifyListeners(SeriesChangeEvent)
|
Number of AST nodes: 0
|
|
Number of AST nodes: 3
|
|
| | | 1 | for (int i = listenerList.length - 2; i >= 0; i -= 2) {↵
|
| | | 2 | if (listenerList[i] == SeriesChangeListener.class) {↵
|
| | | 3 | ((SeriesChangeListener) listenerList[i + 1]).seriesChanged(↵
|
| | | 4 | event);↵
|
| | | 5 | }↵
|
| | | 6 | }
|
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 | Clones are in different classes |
Number of node comparisons | 0 |