for (int item = 0; item < itemCount; item++) { double lvalue = ixyd.getStartYValue(series, item); double uvalue = ixyd.getEndYValue(series, item); if (!Double.isNaN(lvalue)) { minimum = Math.min(minimum, lvalue); } if (!Double.isNaN(uvalue)) { maximum = Math.max(maximum, uvalue); } }
for (int item = 0; item < itemCount; item++) { double lvalue = ohlc.getLowValue(series, item); double uvalue = ohlc.getHighValue(series, item); if (!Double.isNaN(lvalue)) { minimum = Math.min(minimum, lvalue); } if (!Double.isNaN(uvalue)) { maximum = Math.max(maximum, uvalue); } }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/general/DatasetUtilities.java File path: /jfreechart-1.0.10/src/org/jfree/data/general/DatasetUtilities.java
Method name: Range iterateRangeBounds(XYDataset, boolean) Method name: Range iterateRangeBounds(XYDataset, boolean)
Number of AST nodes: 7 Number of AST nodes: 7
1
for (int item = 0; item < itemCount; item++) {
1
for (int item = 0; item < itemCount; item++) {
2
                    double lvalue = ixyd.getStartYValue(series, item);
2
                    double lvalue = ohlc.getLowValue(series, item);
3
                    double uvalue = ixyd.getEndYValue(series, item);
3
                    double uvalue = ohlc.getHighValue(series, item);
4
                    if (!Double.isNaN(lvalue)) {
4
                    if (!Double.isNaN(lvalue)) {
5
                        minimum = Math.min(minimum, lvalue);
5
                        minimum = Math.min(minimum, lvalue);
6
                    }
6
                    }
7
                    if (!Double.isNaN(uvalue)) {
7
                    if (!Double.isNaN(uvalue)) {
8
                        maximum = Math.max(maximum, uvalue);
8
                        maximum = Math.max(maximum, uvalue);
9
                    }
9
                    }
10
                }
10
                }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.7
Clones locationClones are in the same method
Number of node comparisons25
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements5
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)1.6
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    8
    for (int item = 0; item < itemCount; item++)
    19
    for (int item = 0; item < itemCount; item++)
    9
    double lvalue = ixyd.getStartYValue(series, item);
    9
    double lvalue = ixyd.getStartYValue(series, item);
    Preondition Violations
    Unmatched statement double lvalue=ixyd.getStartYValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                                                                        
    10
    double uvalue = ixyd.getEndYValue(series, item);
    10
    double uvalue = ixyd.getEndYValue(series, item);
    Preondition Violations
    Unmatched statement double uvalue=ixyd.getEndYValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                                                                      
                                                                                                    
    20
    double lvalue = ohlc.getLowValue(series, item);
    Preondition Violations
    Unmatched statement double lvalue=ohlc.getLowValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    20
    double lvalue = ohlc.getLowValue(series, item);
                                                                                                      
    21
    double uvalue = ohlc.getHighValue(series, item);
    Preondition Violations
    Unmatched statement double uvalue=ohlc.getHighValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    21
    double uvalue = ohlc.getHighValue(series, item);
    11
    if (!Double.isNaN(lvalue))
    22
    if (!Double.isNaN(lvalue))
    12
    minimum = Math.min(minimum, lvalue);
    23
    minimum = Math.min(minimum, lvalue);
    13
    if (!Double.isNaN(uvalue))
    24
    if (!Double.isNaN(uvalue))
    14
    maximum = Math.max(maximum, uvalue);
    25
    maximum = Math.max(maximum, uvalue);
    Precondition Violations (5)
    Row Violation
    1Unmatched statement double lvalue=ixyd.getStartYValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    2Unmatched statement double uvalue=ixyd.getEndYValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    3Unmatched statement double lvalue=ohlc.getLowValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    4Unmatched statement double uvalue=ohlc.getHighValue(series,item); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    5Clone fragment #1 returns variables item, minimum, maximum , while Clone fragment #2 returns variables item, minimum, maximum