1586-1-2

if (seriesCount > 1) { double seriesGap = dataArea.getHeight() * getItemMargin() / (categoryCount * (seriesCount - 1)); rectY = rectY + row * (state.getBarWidth() + seriesGap); } else { rectY = rectY + row * state.getBarWidth(); }
if (seriesCount > 1) { double seriesGap = dataArea.getWidth() * getItemMargin() / (categoryCount * (seriesCount - 1)); rectX = rectX + row * (state.getBarWidth() + seriesGap); } else { rectX = rectX + row * state.getBarWidth(); }

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

1

    if (seriesCount > 1) {↵

1

    if (seriesCount > 1) {↵

2

                    double seriesGap = dataArea.getHeight() * getItemMargin()↵

2

                    double seriesGap = dataArea.getWidth() * getItemMargin()↵

3

                                       / (categoryCount * (seriesCount - 1));↵

3

                                       / (categoryCount * (seriesCount - 1));↵

4

                    rectY = rectY + row * (state.getBarWidth() + seriesGap);↵

4

                    rectX = rectX + row * (state.getBarWidth() + seriesGap);↵

5

                }↵

5

                }↵

6

                else {↵

6

                else {↵

7

                    rectY = rectY + row * state.getBarWidth();↵

7

                    rectX = rectX + row * state.getBarWidth();↵

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