if (!bar.contains(bounds.getBounds2D())) { if (!negative) { position = getPositiveItemLabelPositionFallback(); } else { position = getNegativeItemLabelPositionFallback(); } if (position != null) { anchorPoint = calculateLabelAnchorPoint( position.getItemLabelAnchor(), bar, plot.getOrientation());
if (!bar.contains(bounds.getBounds2D())) { if (!negative) { position = getPositiveItemLabelPositionFallback(); } else { position = getNegativeItemLabelPositionFallback(); } if (position != null) { anchorPoint = calculateLabelAnchorPoint( position.getItemLabelAnchor(), bar, plot.getOrientation());
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/BarRenderer.java File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYBarRenderer.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (!bar.contains(bounds.getBounds2D())) {
1
if (!bar.contains(bounds.getBounds2D())) {
2
                    if (!negative) {
2
                    if (!negative) {
3
                        position = getPositiveItemLabelPositionFallback();
3
                        position = getPositiveItemLabelPositionFallback();
4
                    }
4
                    }
5
                    else {
5
                    else {
6
                        position = getNegativeItemLabelPositionFallback();
6
                        position = getNegativeItemLabelPositionFallback();
7
                    }
7
                    }
8
                    if (position != null) {
8
                    if (position != null) {
9
                        anchorPoint = calculateLabelAnchorPoint(
9
                        anchorPoint = calculateLabelAnchorPoint(
10
                                position.getItemLabelAnchor(), bar,
10
                                position.getItemLabelAnchor(), bar, 
11
                                plot.getOrientation());
11
                                plot.getOrientation());
12
                    
12
                    
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