1000-2-4

public void removeAllSeries() { // Unregister the collection as a change listener to each series in // the collection. for (int i = 0; i < this.seriesList.size(); i++) { MatrixSeries series = (MatrixSeries) this.seriesList.get(i); series.removeChangeListener(this); } // Remove all the series from the collection and notify listeners. this.seriesList.clear(); fireDatasetChanged();
public void removeAllSeries() { // Unregister the collection as a change listener to each series in // the collection. for (int i = 0; i < this.data.size(); i++) { XIntervalSeries series = (XIntervalSeries) this.data.get(i); series.removeChangeListener(this); } this.data.clear(); 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: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void removeAllSeries() {↵

1

    public void removeAllSeries() {↵

2

            // Unregister the collection as a change listener to each series in↵

2

            // Unregister the collection as a change listener to each series in↵

3

            // the collection.↵

3

            // the collection.↵

4

            for (int i = 0; i < this.seriesList.size(); i++) {↵

4

            for (int i = 0; i < this.data.size(); i++) {↵

5

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

5

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

6

                series.removeChangeListener(this);↵

6

              series.removeChangeListener(this);↵

7

            }↵

7

            }↵

8

            // Remove all the series from the collection and notify listeners.↵

8

            ↵

9

            this.seriesList.clear();↵

9

    this.data.clear();↵

10

            fireDatasetChanged();↵

10

            fireDatasetChanged();↵

11

11

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