Map.Entry entry = (Map.Entry) i.next();
if (((Integer) entry.getValue()).equals(index)) {
if (((Number) entry.getKey()).doubleValue() < minValue) {
minValue = ((Number) entry.getKey()).doubleValue();
}
}
Map.Entry entry = (Map.Entry) i.next();
if (((Integer) entry.getValue()).equals(index)) {
if (((Number) entry.getKey()).doubleValue() > maxValue) {
maxValue = ((Number) entry.getKey()).doubleValue();
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/WaferMapRenderer.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/WaferMapRenderer.java
|
Method name: Number getMinPaintValue(Integer)
|
|
Method name: Number getMaxPaintValue(Integer)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | Map.Entry entry = (Map.Entry) i.next();↵ | | 1 | Map.Entry entry = (Map.Entry) i.next();↵
|
2 | if (((Integer) entry.getValue()).equals(index)) {↵ | | 2 | if (((Integer) entry.getValue()).equals(index)) {↵
|
3 | if (((Number) entry.getKey()).doubleValue() < minValue) {↵ | | 3 | if (((Number) entry.getKey()).doubleValue() > maxValue) {↵
|
4 | minValue = ((Number) entry.getKey()).doubleValue();↵ | | 4 | maxValue = ((Number) entry.getKey()).doubleValue();↵
|
5 | }↵ | | 5 | }↵
|
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.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |