rectX = domainAxis.getCategoryStart(column, getColumnCount(), dataArea, domainAxisLocation); if (seriesCount > 1) { double seriesGap = dataArea.getWidth() * getItemMargin() / (categoryCount * (seriesCount - 1)); rectX = rectX + row * (state.getBarWidth() + seriesGap); } else { rectX = rectX + row * state.getBarWidth(); } rectY = java2dValue0;
rectX = domainAxis.getCategoryStart(column, getColumnCount(), dataArea, domainAxisLocation); if (seriesCount > 1) { double seriesGap = dataArea.getWidth() * getItemMargin() / (categoryCount * (seriesCount - 1)); rectX = rectX + row * (state.getBarWidth() + seriesGap); } else { rectX = rectX + row * state.getBarWidth(); } rectY = j2dy0;
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/WaterfallBarRenderer.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
rectX = domainAxis.getCategoryStart(column, getColumnCount(),
1
rectX = domainAxis.getCategoryStart(column, getColumnCount(),
2
                    dataArea, domainAxisLocation);
2
                    dataArea, domainAxisLocation);
3
            if (seriesCount > 1) {
3
            if (seriesCount > 1) {
4
                double seriesGap = dataArea.getWidth() * getItemMargin()
4
                double seriesGap = dataArea.getWidth() * getItemMargin()
5
                                   / (categoryCount * (seriesCount - 1));
5
                                   / (categoryCount * (seriesCount - 1));
6
                rectX = rectX + row * (state.getBarWidth() + seriesGap);
6
                rectX = rectX + row * (state.getBarWidth() + seriesGap);
7
            }
7
            }
8
            else {
8
            else {
9
                rectX = rectX + row * state.getBarWidth();
9
                rectX = rectX + row * state.getBarWidth();
10
            }
10
            }
11
            rectY = java2dValue0;
11
            rectY = j
12
2dy0;
13
        
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0