if (edge == RectangleEdge.BOTTOM) { result = this.positionForAxisAtBottom; } else if (edge == RectangleEdge.LEFT) { result = this.positionForAxisAtLeft; } else if (edge == RectangleEdge.RIGHT) { result = this.positionForAxisAtRight; }
if (edge == RectangleEdge.BOTTOM) { this.bottomBlock = block; } else if (edge == RectangleEdge.LEFT) { this.leftBlock = block; } else if (edge == RectangleEdge.RIGHT) { this.rightBlock = block; }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/CategoryLabelPositions.java File path: /jfreechart-1.0.10/src/org/jfree/chart/block/BorderArrangement.java
Method name: CategoryLabelPosition getLabelPosition(RectangleEdge) Method name: void add(Block, Object)
Number of AST nodes: 6 Number of AST nodes: 6
1
if (edge == RectangleEdge.BOTTOM) {
1
if (edge == RectangleEdge.BOTTOM) {
2
            result = this.positionForAxisAtBottom;
2
                this.bottomBlock = block;
3
        }
3
            }
4
        else if (edge == RectangleEdge.LEFT) {
4
            else if (edge == RectangleEdge.LEFT) {
5
            result = this.positionForAxisAtLeft;
5
                this.leftBlock = block;
6
        }
6
            }
7
        else if (edge == RectangleEdge.RIGHT) {
7
            else if (edge == RectangleEdge.RIGHT) {
8
            result = this.positionForAxisAtRight;
8
            
9
    this.rightBlock = block;
9
        }
10
            }
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 locationClones are in different classes
Number of node comparisons0