if (isInverted()) {
result = maxX + ((value - axisMin) / (axisMax - axisMin))
* (minX - maxX);
}
else {
result = minX + ((value - axisMin) / (axisMax - axisMin))
* (maxX - minX);
}
if (isInverted()) {
result = maxX + ((value - axisMin) / (axisMax - axisMin))
* (minX - maxX);
}
else {
result = minX + ((value - axisMin) / (axisMax - axisMin))
* (maxX - minX);
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/DateAxis.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/PeriodAxis.java
|
Method name: double valueToJava2D(double, Rectangle2D, RectangleEdge)
|
|
Method name: double valueToJava2D(double, Rectangle2D, RectangleEdge)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if (isInverted()) {↵ | | 1 | if (isInverted()) {↵
|
2 | result = maxX + ((value - axisMin) / (axisMax - axisMin))↵ | | 2 | result = maxX + ((value - axisMin) / (axisMax - axisMin)) ↵
|
3 | * (minX - maxX);↵ | | 3 | * (minX - maxX);↵
|
4 | }↵ | | 4 | }↵
|
5 | else {↵ | | 5 | else {↵
|
6 | result = minX + ((value - axisMin) / (axisMax - axisMin))↵ | | 6 | result = minX + ((value - axisMin) / (axisMax - axisMin)) ↵
|
7 | * (maxX - minX);↵ | | 7 | * (maxX - minX);↵
|
8 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 10 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 23.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
9 | if (isInverted()) | | 7 | if (isInverted()) |
10 | result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX); | | 8 | result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX); |
| | | | |
11 | result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX); | | 9 | result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX); |
Precondition Violations (0)
Row |
Violation |