else if (edge == RectangleEdge.TOP) {
mark = new Line2D.Double(xx, cursor - ol, xx, cursor + il);
}
else if (edge == RectangleEdge.BOTTOM) {
mark = new Line2D.Double(xx, cursor + ol, xx, cursor - il);
else if (edge == RectangleEdge.TOP) {
mark = new Line2D.Double(xx, cursor - ol, xx, cursor + il);
}
else if (edge == RectangleEdge.BOTTOM) {
mark = new Line2D.Double(xx, cursor + ol, xx, cursor - il);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/CyclicNumberAxis.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/ValueAxis.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | else if (edge == RectangleEdge.TOP) {↵ | | 1 | else if (edge == RectangleEdge.TOP) {↵
|
2 | mark = new Line2D.Double(xx, cursor - ol, xx, cursor + il);↵ | | 2 | mark = new Line2D.Double(xx, cursor - ol, xx, cursor + il);↵
|
3 | }↵ | | 3 | }↵
|
4 | else if (edge == RectangleEdge.BOTTOM) {↵ | | 4 | else if (edge == RectangleEdge.BOTTOM) {↵
|
5 | mark = new Line2D.Double(xx, cursor + ol, xx, cursor - il);↵ | | 5 | mark = new Line2D.Double(xx, cursor + ol, xx, cursor - il);↵
|
6 | | | 6 |
|
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 |