for (int i = listeners.length - 2; i >= 0; i -= 2) {
if (listeners[i] == ChartProgressListener.class) {
((ChartProgressListener) listeners[i + 1]).chartProgress(event);
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/JFreeChart.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/general/AbstractDataset.java
|
Method name: void notifyListeners(ChartProgressEvent)
|
|
Method name: void notifyListeners(DatasetChangeEvent)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 0
|
|
1 | for (int i = listeners.length - 2; i >= 0; i -= 2) {↵ | | | |
2 | if (listeners[i] == ChartProgressListener.class) {↵ | | | |
3 | ((ChartProgressListener) listeners[i + 1]).chartProgress(event);↵ | | | |
4 | }↵ | | | |
5 | } | | | |
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 |