1016-1-2

for (int f = 0; f < 6; f++) { if (f == 5) { g2.setPaint(fillPaint); } else { g2.setPaint(fillPaintDark); } g2.fill(faces[f]); if (drawOutlines) { g2.setPaint(outlinePaint); g2.draw(faces[f]); } }
for (int f = 0; f < 6; f++) { if (f == 5) { g2.setPaint(fillPaint); } else { g2.setPaint(fillPaintDark); } g2.fill(faces[f]); if (drawOutlines) { g2.setPaint(outlinePaint); g2.draw(faces[f]); } }

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/StackedBarRenderer3D.java |  | File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/StackedBarRenderer3D.java
Method name: `void drawStackHorizontal(List, Comparable, Graphics2D, CategoryItemRendererState, Rectangle2D, CategoryPlot, CategoryAxis, ValueAxis, CategoryDataset)` |  | Method name: `void drawStackVertical(List, Comparable, Graphics2D, CategoryItemRendererState, Rectangle2D, CategoryPlot, CategoryAxis, ValueAxis, CategoryDataset)`
Number of AST nodes: 8 |  | Number of AST nodes: 8

1

    for (int f = 0; f < 6; f++) {↵

1

    for (int f = 0; f < 6; f++) {↵

2

                    if (f == 5) {↵

2

                    if (f == 5) {↵

3

                        g2.setPaint(fillPaint);↵

3

                        g2.setPaint(fillPaint);↵

4

                    }↵

4

                    }↵

5

                    else {↵

5

                    else {↵

6

                        g2.setPaint(fillPaintDark);↵

6

                        g2.setPaint(fillPaintDark);↵

7

                    }↵

7

                    }↵

8

                    g2.fill(faces[f]);↵

8

                    g2.fill(faces[f]);↵

9

                    if (drawOutlines) {↵

9

                    if (drawOutlines) {↵

10

                        g2.setPaint(outlinePaint);↵

10

                        g2.setPaint(outlinePaint);↵

11

                        g2.draw(faces[f]);↵

11

                        g2.draw(faces[f]);↵

12

                    }↵

12

                    }↵

13

                }

13

                }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 1
Number of refactorable cases | 1
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3
Clones location | Clones are declared in the same class
Number of node comparisons | 34

1. {Refactorable}

   Mapping Summary
   Number of mapped statements | 8
   Number of unmapped statements in the first code fragment | 0
   Number of unmapped statements in the second code fragment | 0
   Time elapsed for statement mapping (ms) | 1.6
   Clone type | Type 1

   Mapped Statements
   ID | Statement |  | ID | Statement
   --- | --- | --- | --- | ---

   31

       for (int f = 0; f < 6; f++)

   31

       for (int f = 0; f < 6; f++)

   32

       if (f == 5)

   32

       if (f == 5)

   33

       g2.setPaint(fillPaint);

   33

       g2.setPaint(fillPaint);

       else

       else

   34

       g2.setPaint(fillPaintDark);

   34

       g2.setPaint(fillPaintDark);

   35

       g2.fill(faces[f]);

   35

       g2.fill(faces[f]);

   36

       if (drawOutlines)

   36

       if (drawOutlines)

   37

       g2.setPaint(outlinePaint);

   37

       g2.setPaint(outlinePaint);

   38

       g2.draw(faces[f]);

   38

       g2.draw(faces[f]);

   Precondition Violations (0)
   Row | Violation
   --- | ---