Comparable key = piedataset.getKey(i); Paint p; if (key.equals(this.aggregatedItemsKey)) { p = this.aggregatedItemsPaint; } else { p = (Paint) this.sectionPaints.get(key); } piePlot.setSectionPaint(key, p);
if (this.shapeFilled) { Paint p = this.fillPaint; if (p instanceof GradientPaint) { GradientPaint gp = (GradientPaint) this.fillPaint; p = this.fillPaintTransformer.transform(gp, s); } g2.setPaint(p); g2.fill(s); }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/MultiplePiePlot.java File path: /jfreechart-1.0.10/src/org/jfree/chart/title/LegendGraphic.java
Method name: void draw(Graphics2D, Rectangle2D, Point2D, PlotState, PlotRenderingInfo) Method name: void draw(Graphics2D, Rectangle2D)
Number of AST nodes: 6 Number of AST nodes: 7
1
Comparable key = piedataset.getKey(i);
1
if (this.shapeFilled) {
2
                Paint p;
2
                Paint p = this.fillPaint;
3
                if (key.equals(this.aggregatedItemsKey)) {
3
                if (
4
                    p = this.aggregatedItems
4
p instanceof GradientPaint) {
5
Paint;
5
                    GradientPaint gp = (GradientPaint) this.fillPaint;
6
                }
6
                
7
       
7
    p = this.fillPaintTransformer.transform(gp, s);
8
         else {
8
                }
9
                    p = (Paint) this.sectionPaints.get(key);
9
                g2.setPaint(p);
10
                }
10
                g2.fill(s);
11
                piePlot.setSectionPaint(key, p);
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.1
Clones locationClones are in different classes
Number of node comparisons1