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: 7 | Number of AST nodes: 7 | |||
1 | double minValue = Double.POSITIVE_INFINITY;↵ | 1 | double maxValue = Double.NEGATIVE_INFINITY;↵ | |
2 | for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext();) {↵ | 2 | for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext();) {↵ | |
3 | Map.Entry entry = (Map.Entry) i.next();↵ | 3 | Map.Entry entry = (Map.Entry) i.next();↵ | |
4 | if (((Integer) entry.getValue()).equals(index)) {↵ | 4 | if (((Integer) entry.getValue()).equals(index)) {↵ | |
5 | if (((Number) entry.getKey()).doubleValue() < minValue) {↵ | 5 | if (((Number) entry.getKey()).doubleValue() > maxValue) {↵ | |
6 | minValue = ((Number) entry.getKey()).doubleValue();↵ | 6 | maxValue = ((Number) entry.getKey()).doubleValue();↵ | |
7 | }↵ | 7 | }↵ | |
8 | }↵ | 8 | }↵ | |
9 | } ↵ | 9 | } ↵ | |
10 | return new Double(minValue); | 10 | return new Double(maxValue); | |
See real code fragment | See real code fragment |
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.7 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 13 |
Number of mapped statements | 7 |
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) | 29.8 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | double minValue = Double.POSITIVE_INFINITY; |
| 1 | double maxValue = Double.NEGATIVE_INFINITY; | |||||||||||||||
2 | for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext(); ) | 2 | for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext(); ) | ||||||||||||||||
3 | Map.Entry entry = (Map.Entry)i.next(); | 3 | Map.Entry entry = (Map.Entry)i.next(); | ||||||||||||||||
4 | if (((Integer)entry.getValue()).equals(index)) | 4 | if (((Integer)entry.getValue()).equals(index)) | ||||||||||||||||
5 | if (((Number)entry.getKey()).doubleValue() < minValue) |
| 5 | if (((Number)entry.getKey()).doubleValue() > maxValue) | |||||||||||||||
6 | minValue = ((Number)entry.getKey()).doubleValue(); |
| 6 | maxValue = ((Number)entry.getKey()).doubleValue(); | |||||||||||||||
7 | return new Double(minValue); |
| 7 | return new Double(maxValue); |
Row | Violation |
---|---|
1 | Expression ((Number)entry.getKey()).doubleValue() < minValue cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression ((Number)entry.getKey()).doubleValue() > maxValue cannot be parameterized, because it has dependencies to/from statements that will be extracted |