1608-4-8

public void notifyListeners(PlotChangeEvent event) { Object[] listeners = this.listenerList.getListenerList(); for (int i = listeners.length - 2; i >= 0; i -= 2) { if (listeners[i] == PlotChangeListener.class) { ((PlotChangeListener) listeners[i + 1]).plotChanged(event);
protected void notifyListeners(SeriesChangeEvent event) { Object[] listenerList = this.listeners.getListenerList(); 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/chart/plot/Plot.java |  | File path: /jfreechart-1.0.10/src/org/jfree/data/general/Series.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void notifyListeners(PlotChangeEvent event) {↵

1

    protected void notifyListeners(SeriesChangeEvent event) {↵

2

            Object[] listeners = this.listenerList.getListenerList();↵

2

            Object[] listenerList = this.listeners.getListenerList();↵

3

            for (int i = listeners.length - 2; i >= 0; i -= 2) {↵

3

            for (int i = listenerList.length - 2; i >= 0; i -= 2) {↵

4

                if (listeners[i] == PlotChangeListener.class) {↵

4

                if (listenerList[i] == SeriesChangeListener.class) {↵

5

                    ((PlotChangeListener) listeners[i + 1]).plotChanged(↵

5

                    ((SeriesChangeListener) listenerList[i + 1]).seriesChanged(↵

6

    event);↵

6

                            event);↵

7

7

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