if (drawBack) {
Area side1 = new Area(new Rectangle2D.Double(
plotArea.getX(), plotArea.getY(),
arc.getStartPoint().getX() - plotArea.getX(),
plotArea.getHeight()));
side1.intersect(back);
g2.setPaint(paint);
g2.fill(side1);
g2.setPaint(outlinePaint);
g2.draw(side1);
}
if (drawFront) {
Area side2 = new Area(new Rectangle2D.Double(
plotArea.getX(), plotArea.getY(),
arc.getEndPoint().getX() - plotArea.getX(),
plotArea.getHeight()));
side2.intersect(front);
g2.setPaint(paint);
g2.fill(side2);
g2.setPaint(outlinePaint);
g2.draw(side2);
}
if (drawBack) {
Area side1 = new Area(new Rectangle2D.Double(
arc.getStartPoint().getX(), plotArea.getY(),
plotArea.getMaxX() - arc.getStartPoint().getX(),
plotArea.getHeight()));
side1.intersect(back);
g2.setPaint(paint);
g2.fill(side1);
g2.setPaint(outlinePaint);
g2.draw(side1);
}
if (drawFront) {
Area side2 = new Area(new Rectangle2D.Double(
arc.getEndPoint().getX(), plotArea.getY(),
plotArea.getMaxX() - arc.getEndPoint().getX(),
plotArea.getHeight()));
side2.intersect(front);
g2.setPaint(paint);
g2.fill(side2);
g2.setPaint(outlinePaint);
g2.draw(side2);
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot3D.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot3D.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (drawBack) {↵ | | 1 | if (drawBack) {↵
|
2 | Area side1 = new Area(new Rectangle2D.Double(↵ | | 2 | Area side1 = new Area(new Rectangle2D.Double(↵
|
3 | plotArea.getX(), plotArea.getY(),↵ | | 3 | arc.getStartPoint().getX(), plotArea.getY(),↵
|
4 | arc.getStartPoint().getX() - plotArea.getX(),↵ | | 4 | plotArea.getMaxX() - arc.getStartPoint().getX(),↵
|
5 | plotArea.getHeight()));↵ | | 5 | plotArea.getHeight()));↵
|
6 | side1.intersect(back);↵ | | 6 | side1.intersect(back);↵
|
7 | g2.setPaint(paint);↵ | | 7 | g2.setPaint(paint);↵
|
8 | g2.fill(side1);↵ | | 8 | g2.fill(side1);↵
|
9 | g2.setPaint(outlinePaint);↵ | | 9 | g2.setPaint(outlinePaint);↵
|
10 | g2.draw(side1);↵ | | 10 | g2.draw(side1);↵
|
11 | }↵ | | 11 | }↵
|
|
12 | if (drawFront) {↵ | | 12 | if (drawFront) {↵
|
13 | Area side2 = new Area(new Rectangle2D.Double(↵ | | 13 | Area side2 = new Area(new Rectangle2D.Double(↵
|
14 | plotArea.getX(), plotArea.getY(),↵ | | 14 | arc.getEndPoint().getX(), plotArea.getY(),↵
|
15 | arc.getEndPoint().getX() - plotArea.getX(),↵ | | 15 | plotArea.getMaxX() - arc.getEndPoint().getX(),↵
|
16 | plotArea.getHeight()));↵ | | 16 | plotArea.getHeight()));↵
|
17 | side2.intersect(front);↵ | | 17 | side2.intersect(front);↵
|
18 | g2.setPaint(paint);↵ | | 18 | g2.setPaint(paint);↵
|
19 | g2.fill(side2);↵ | | 19 | g2.fill(side2);↵
|
20 | g2.setPaint(outlinePaint);↵ | | 20 | g2.setPaint(outlinePaint);↵
|
21 | g2.draw(side2);↵ | | 21 | g2.draw(side2);↵
|
22 | } | | 22 | }
|
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 |