1572-1-2

public Number getStartX(int series, int item) { DatasetInfo di = getDatasetInfo(series); if (di.data instanceof IntervalXYDataset) { return ((IntervalXYDataset) di.data).getStartX(di.series, item); } else { return getX(series, item);
public Number getEndX(int series, int item) { DatasetInfo di = getDatasetInfo(series); if (di.data instanceof IntervalXYDataset) { return ((IntervalXYDataset) di.data).getEndX(di.series, item); } else { return getX(series, item);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/general/CombinedDataset.java |  | File path: /jfreechart-1.0.10/src/org/jfree/data/general/CombinedDataset.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public Number getStartX(int series, int item) {↵

1

    public Number getEndX(int series, int item) {↵

2

            DatasetInfo di = getDatasetInfo(series);↵

2

            DatasetInfo di = getDatasetInfo(series);↵

3

            if (di.data instanceof IntervalXYDataset) {↵

3

            if (di.data instanceof IntervalXYDataset) {↵

4

                return ((IntervalXYDataset) di.data).getStartX(di.series, item);↵

4

                return ((IntervalXYDataset) di.data).getEndX(di.series, item);↵

5

            }↵

5

            }↵

6

            else {↵

6

            else {↵

7

                return getX(series, item);↵

7

                return getX(series, item);↵

8

8

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