for (int k = 0; k < this.zValues.length; k++) {
if (this.zValues[k] != null) {
zMin = Math.min(zMin, this.zValues[k].doubleValue());
}
}
for (int k = 0; k < this.zValues.length; k++) {
if (this.zValues[k] != null) {
zMin = Math.min(zMin, this.zValues[k].doubleValue());
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/contour/DefaultContourDataset.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/contour/DefaultContourDataset.java
|
Method name: double getMinZValue()
|
|
Method name: double getMinZValue(double, double, double, double)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int k = 0; k < this.zValues.length; k++) {↵ | | 1 | for (int k = 0; k < this.zValues.length; k++) {↵
|
2 | if (this.zValues[k] != null) {↵ | | 2 | if (this.zValues[k] != null) {↵
|
3 | zMin = Math.min(zMin, this.zValues[k].doubleValue());↵ | | 3 | zMin = Math.min(zMin, this.zValues[k].doubleValue());↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
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.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 5 |
-
{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) | 1.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | for (int k = 0; k < this.zValues.length; k++) | | 2 | for (int k = 0; k < this.zValues.length; k++) |
3 | if (this.zValues[k] != null) | | 3 | if (this.zValues[k] != null) |
4 | zMin = Math.min(zMin, this.zValues[k].doubleValue()); | | 4 | zMin = Math.min(zMin, this.zValues[k].doubleValue()); |
Precondition Violations (0)
Row |
Violation |