if (this.orientation == PlotOrientation.HORIZONTAL) {
r[0] = new Rectangle2D.Double(Math.min(yymax, yy),
Math.min(xxmin, xx), Math.abs(yy - yymax),
Math.abs(xx - xxmin)
);
}
else { // PlotOrientation.VERTICAL
r[0] = new Rectangle2D.Double(Math.min(xxmin, xx),
Math.min(yymax, yy), Math.abs(xx - xxmin),
Math.abs(yy - yymax));
}
somethingToDraw = true;
if (this.orientation == PlotOrientation.HORIZONTAL) {
r[1] = new Rectangle2D.Double(Math.min(yymax, yy),
Math.min(xxmax, xx), Math.abs(yy - yymax),
Math.abs(xx - xxmax));
}
else { // PlotOrientation.VERTICAL
r[1] = new Rectangle2D.Double(Math.min(xx, xxmax),
Math.min(yymax, yy), Math.abs(xx - xxmax),
Math.abs(yy - yymax));
}
somethingToDraw = true;
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/XYPlot.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/XYPlot.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (this.orientation == PlotOrientation.HORIZONTAL) {↵ | | 1 | if (this.orientation == PlotOrientation.HORIZONTAL) {↵
|
2 | r[0] = new Rectangle2D.Double(Math.min(yymax, yy),↵ | | 2 | r[1] = new Rectangle2D.Double(Math.min(yymax, yy),↵
|
3 | Math.min(xxmin, xx), Math.abs(yy - yymax),↵ | | 3 | Math.min(xxmax, xx), Math.abs(yy - yymax),↵
|
4 | Math.abs(xx - xxmin)↵ | | 4 | Math.abs(xx - xxm↵
|
5 | );↵ | | 5 | ax));↵
|
6 | }↵ | | 6 | }↵
|
7 | else { // PlotOrientation.VERTICAL↵ | | 7 | else { // PlotOrientation.VERTICAL↵
|
8 | r[0] = new Rectangle2D.Double(Math.min(xxmin, xx),↵ | | 8 | r[1] = new Rectangle2D.Double(Math.min(xx, xxmax),↵
|
9 | Math.min(yymax, yy), Math.abs(xx - xxmin),↵ | | 9 | Math.min(yymax, yy), Math.abs(xx - xxmax),↵
|
10 | Math.abs(yy - yymax));↵ | | 10 | Math.abs(yy - yymax));↵
|
11 | }↵ | | 11 | }↵
|
12 | somethingToDraw = true;↵ | | 12 | somethingToDraw = true;↵
|
13 | | | 13 |
|
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 |