if (autoPopulate) { DrawingSupplier ds = getDrawingSupplier(); if (ds != null) { result = ds.getNextPaint(); this.sectionPaintMap.put(key, result); } else { result = this.baseSectionPaint; } } else { result = this.baseSectionPaint; }
if (autoPopulate) { DrawingSupplier ds = getDrawingSupplier(); if (ds != null) { result = ds.getNextOutlinePaint(); this.sectionOutlinePaintMap.put(key, result); } else { result = this.baseSectionOutlinePaint; } } else { result = this.baseSectionOutlinePaint; }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot.java File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (autoPopulate) {
1
if (autoPopulate) {
2
            DrawingSupplier ds = getDrawingSupplier();
2
            DrawingSupplier ds = getDrawingSupplier();
3
            if (ds != null) {
3
            if (ds != null) {
4
                result = ds.getNextPaint();
4
                result = ds.getNextOutlinePaint();
5
                this.sectionPaintMap.put(key, result);
5
                this.sectionOutlinePaintMap.put(key, result);
6
            }
6
            }
7
            else {
7
            else {
8
                result = this.baseSectionPaint;
8
                result = this.baseSectionOutlinePaint;
9
            }
9
            }
10
        }
10
        }
11
        else {
11
        else {
12
            result = this.baseSectionPaint;
12
            result = this.baseSectionOutlinePaint;
13
        }
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