float lowest = Float.POSITIVE_INFINITY; float highest = Float.NEGATIVE_INFINITY; for (int i = 0; i < data[0].length; i++) { float v = data[0][i]; if (v < lowest) { lowest = v; } if (v > highest) { highest = v; } } if (lowest <= highest) { result = new Range(lowest, highest); }
float lowest = Float.POSITIVE_INFINITY; float highest = Float.NEGATIVE_INFINITY; for (int i = 0; i < data[0].length; i++) { float v = data[1][i]; if (v < lowest) { lowest = v; } if (v > highest) { highest = v; } } if (lowest <= highest) { result = new Range(lowest, highest); }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/FastScatterPlot.java File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/FastScatterPlot.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
float lowest = Float.POSITIVE_INFINITY;
1
float lowest = Float.POSITIVE_INFINITY;
2
            float highest = Float.NEGATIVE_INFINITY;
2
            float highest = Float.NEGATIVE_INFINITY;
3
            for (int i = 0; i < data[0].length; i++) {
3
            for (int i = 0; i < data[0].length; i++) {
4
                float v = data[0][i];
4
                float v = data[1][i];
5
                if (v < lowest) {
5
                if (v < lowest) {
6
                    lowest = v;
6
                    lowest = v;
7
                }
7
                }
8
                if (v > highest) {
8
                if (v > highest) {
9
                    highest = v;
9
                    highest = v;
10
                }
10
                }
11
            }
11
            }
12
            if (lowest <= highest) {
12
            if (lowest <= highest) {
13
                result = new Range(lowest, highest);
13
                result = new Range(lowest, highest);
14
            }
14
            }
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