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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
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 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |