Object obj = iterator.next();
if (obj instanceof Number) {
Number n = (Number) obj;
double v = n.doubleValue();
if (!Double.isNaN(v)) {
vlist.add(n);
Object obj = iterator.next();
if (obj instanceof Number) {
Number n = (Number) obj;
double v = n.doubleValue();
if (!Double.isNaN(v)) {
vlist.add(n);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/BoxAndWhiskerCalculator.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultMultiValueCategoryDataset.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | Object obj = iterator.next();↵ | | 1 | Object obj = iterator.next();↵
|
2 | if (obj instanceof Number) {↵ | | 2 | if (obj instanceof Number) {↵
|
3 | Number n = (Number) obj;↵ | | 3 | Number n = (Number) obj;↵
|
4 | double v = n.doubleValue();↵ | | 4 | double v = n.doubleValue();↵
|
5 | if (!Double.isNaN(v)) {↵ | | 5 | if (!Double.isNaN(v)) {↵
|
6 | vlist.add(n);↵ | | 6 | vlist.add(n);↵
|
7 | | | 7 |
|
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.0 |
Clones location | |
Number of node comparisons | 0 |