if (((int) dataArea.getMinX() < x) && (x < (int) dataArea.getMaxX())) {
if (this.verticalTraceLine != null) {
g2.draw(this.verticalTraceLine);
this.verticalTraceLine.setLine(x, (int) dataArea.getMinY(), x,
(int) dataArea.getMaxY());
}
else {
this.verticalTraceLine = new Line2D.Float(x,
(int) dataArea.getMinY(), x, (int) dataArea.getMaxY());
}
g2.draw(this.verticalTraceLine);
}
if (((int) dataArea.getMinY() < y) && (y < (int) dataArea.getMaxY())) {
if (this.horizontalTraceLine != null) {
g2.draw(this.horizontalTraceLine);
this.horizontalTraceLine.setLine((int) dataArea.getMinX(), y,
(int) dataArea.getMaxX(), y);
}
else {
this.horizontalTraceLine = new Line2D.Float(
(int) dataArea.getMinX(), y, (int) dataArea.getMaxX(),
y);
}
g2.draw(this.horizontalTraceLine);
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/ChartPanel.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/ChartPanel.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (((int) dataArea.getMinX() < x) && (x < (int) dataArea.getMaxX())) {↵ | | 1 | if (((int) dataArea.getMinY() < y) && (y < (int) dataArea.getMaxY())) {↵
|
|
2 | if (this.verticalTraceLine != null) {↵ | | 2 | if (this.horizontalTraceLine != null) {↵
|
3 | g2.draw(this.verticalTraceLine);↵ | | 3 | g2.draw(this.horizontalTraceLine);↵
|
4 | this.verticalTraceLine.setLine(x, (int) dataArea.getMinY(), x,↵ | | 4 | this.horizontalTraceLine.setLine((int) dataArea.getMinX(), y,↵
|
5 | (int) dataArea.getMaxY());↵ | | 5 | (int) dataArea.getMaxX(), y);↵
|
6 | }↵ | | 6 | }↵
|
7 | else {↵ | | 7 | else {↵
|
8 | this.verticalTraceLine = new Line2D.Float(x,↵ | | 8 | this.horizontalTraceLine = new Line2D.Float(↵
|
9 | (int) dataArea.getMinY(), x, (int) dataArea.getMaxY()↵ | | 9 | (int) dataArea.getMinX(), y, (int) dataArea.getMaxX(),↵
|
10 | );↵ | | 10 | y);↵
|
11 | }↵ | | 11 | }↵
|
12 | g2.draw(this.verticalTraceLine);↵ | | 12 | g2.draw(this.horizontalTraceLine);↵
|
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 |