for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext();) { Map.Entry entry = (Map.Entry) i.next(); if (((Integer) entry.getValue()).equals(index)) { if (((Number) entry.getKey()).doubleValue() < minValue) { minValue = ((Number) entry.getKey()).doubleValue();
for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext();) { 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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext();) {
1
for (Iterator i = this.paintIndex.entrySet().iterator(); i.hasNext();) {
2
            Map.Entry entry = (Map.Entry) i.next();
2
            Map.Entry entry = (Map.Entry) i.next();
3
            if (((Integer) entry.getValue()).equals(index)) {
3
            if (((Integer) entry.getValue()).equals(index)) {
4
                if (((Number) entry.getKey()).doubleValue() < minValue) {
4
                if (((Number) entry.getKey()).doubleValue() > maxValue) {
5
                    minValue = ((Number) entry.getKey()).doubleValue();
5
                    maxValue = ((Number) entry.getKey()).doubleValue();
6
                
6
                
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0