else if (plot.getOrientation() == PlotOrientation.VERTICAL) { completeBar = new Rectangle2D.Double(rectStart + start * rectBreadth, translatedValue0 + rectLength * (1 - p), rectBreadth * (end - start), rectLength * p); incompleteBar = new Rectangle2D.Double(rectStart + start * rectBreadth, translatedValue0, rectBreadth * (end - start), rectLength * (1 - p));
else if (plot.getOrientation() == PlotOrientation.VERTICAL) { completeBar = new Rectangle2D.Double(rectStart + start * rectBreadth, java2dValue1 + rectLength * (1 - p), rectBreadth * (end - start), rectLength * p); incompleteBar = new Rectangle2D.Double(rectStart + start * rectBreadth, java2dValue1, rectBreadth * (end - start), rectLength * (1 - p));
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/GanttRenderer.java File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/GanttRenderer.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
else if (plot.getOrientation() == PlotOrientation.VERTICAL) {
1
else if (plot.getOrientation() == PlotOrientation.VERTICAL) {
2
                    completeBar = new Rectangle2D.Double(rectStart + start
2
                completeBar = new Rectangle2D.Double(rectStart + start
3
                            * rectBreadth, translatedValue0 + rectLength
3
                        * rectBreadth, java2dValue1 + rectLength
4
     
4
 * (1 - p),
5
                       * (1 - p), rectBreadth * (end - start),
5
                        rectBreadth * (end - start),
6
                            rectLength * p);
6
 rectLength * p);
7
                    incompleteBar = new Rectangle2D.Double(rectStart + start
7
                incompleteBar = new Rectangle2D.Double(rectStart + start
8
                            * rectBreadth, translatedValue0, rectBreadth
8
                        * rectBreadth, java2dValue1, rectBreadth
9
     
9
 * (end
10
                       * (end - start), rectLength * (1 - p));
10
                        - start), rectLength * (1 - p));
11
                
11
            
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