1008-2-3

if ((seriesIndex < 0) || (seriesIndex > getSeriesCount())) { throw new IllegalArgumentException("Index outside valid range."); } // fetch the series, remove the change listener, then remove the series. MatrixSeries series = (MatrixSeries) this.seriesList.get(seriesIndex); series.removeChangeListener(this); this.seriesList.remove(seriesIndex); fireDatasetChanged();
if ((series < 0) || (series >= getSeriesCount())) { throw new IllegalArgumentException("Series index out of bounds."); } XIntervalSeries ts = (XIntervalSeries) this.data.get(series); ts.removeChangeListener(this); this.data.remove(series); fireDatasetChanged();

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/xy/MatrixSeriesCollection.java |  | File path: /jfreechart-1.0.10/src/org/jfree/data/xy/XIntervalSeriesCollection.java
Method name: `void removeSeries(int)` |  | Method name: `void removeSeries(int)`
Number of AST nodes: 6 |  | Number of AST nodes: 6

1

    if ((seriesIndex < 0) || (seriesIndex > getSeriesCount())) {↵

1

    if ((series < 0) || (series >= getSeriesCount())) {↵

2

                throw new IllegalArgumentException("Index outside valid range.");↵

2

                throw new IllegalArgumentException("Series index out of bounds.");↵

3

            }↵

3

            }↵

4

            // fetch the series, remove the change listener, then remove the series.↵

4

            ↵

5

            MatrixSeries series = (MatrixSeries) this.seriesList.get(seriesIndex);↵

5

    XIntervalSeries ts = (XIntervalSeries) this.data.get(series);↵

6

            series.removeChangeListener(this);↵

6

            ts.removeChangeListener(this);↵

7

            this.seriesList.remove(seriesIndex);↵

7

            this.data.remove(series);↵

8

            fireDatasetChanged();

8

            fireDatasetChanged();

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.2
Clones location | Clones are in different classes having the same super class
Number of node comparisons | 1