if (count > 0) { if (count % 2 == 1) { if (count > 1) { result = Statistics.calculateMedian(values, 0, count / 2); } else { result = Statistics.calculateMedian(values, 0, 0); } } else { result = Statistics.calculateMedian(values, 0, count / 2 - 1); } }
if (count > 0) { if (count % 2 == 1) { if (count > 1) { result = Statistics.calculateMedian(values, count / 2, count - 1); } else { result = Statistics.calculateMedian(values, 0, 0); } } else { result = Statistics.calculateMedian(values, count / 2, count - 1); } }
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/BoxAndWhiskerCalculator.java
Method name: double calculateQ1(List) Method name: double calculateQ3(List)
Number of AST nodes: 6 Number of AST nodes: 6
1
if (count > 0) {
1
if (count > 0) {
2
            if (count % 2 == 1) {
2
            if (count % 2 == 1) {
3
                if (count > 1) {
3
                if (count > 1) {
4
                    result = Statistics.calculateMedian(values, 0, count / 2
4
                    result = Statistics.calculateMedian(values, count / 2, 
5
);
5
                            count - 1);
6
                }
6
                }
7
                else {
7
                else {
8
                    result = Statistics.calculateMedian(values, 0, 0);
8
                    result = Statistics.calculateMedian(values, 0, 0);
9
                }
9
                }
10
            }
10
            }
11
            else {
11
            else {
12
                result = Statistics.calculateMedian(values, 0, count / 2 - 1);
12
                result = Statistics.calculateMedian(values, count / 2, 
13
            }
13
                        count - 1);
14
            
14
            }
15
        }
15
        }
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.2
Clones locationClones are declared in the same class
Number of node comparisons14
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements5
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)1.2
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    5
    if (count > 0)
    5
    if (count > 0)
    6
    if (count % 2 == 1)
    6
    if (count % 2 == 1)
    7
    if (count > 1)
    7
    if (count > 1)
                                                                                                                                      
    8
    result = Statistics.calculateMedian(values, count / 2, count - 1);
    Preondition Violations
    Unmatched statement result=Statistics.calculateMedian(values,count / 2,count - 1); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    8
    result = Statistics.calculateMedian(values, count / 2, count - 1);
    8
    result = Statistics.calculateMedian(values, 0, count / 2);
    8
    result = Statistics.calculateMedian(values, 0, count / 2);
    Preondition Violations
    Unmatched statement result=Statistics.calculateMedian(values,0,count / 2); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
                                                                                                                      
    else
    else
    9
    result = Statistics.calculateMedian(values, 0, 0);
    9
    result = Statistics.calculateMedian(values, 0, 0);
    else
    else
    10
    result = Statistics.calculateMedian(values, 0, count / 2 - 1);
    10
    result = Statistics.calculateMedian(values, 0, count / 2 - 1);
    10
    result = Statistics.calculateMedian(values, count / 2, count - 1);
    Differences
    Expression1Expression2Difference
    0count / 2TYPE_COMPATIBLE_REPLACEMENT
    count / 2countINFIX_LEFT_OPERAND_MISMATCH
    Preondition Violations
    Expression count / 2 cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression count / 2 cannot be parameterized, because it has dependencies to/from statements that will be extracted
    10
    result = Statistics.calculateMedian(values, count / 2, count - 1);
    Precondition Violations (4)
    Row Violation
    1Unmatched statement result=Statistics.calculateMedian(values,count / 2,count - 1); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    2Unmatched statement result=Statistics.calculateMedian(values,0,count / 2); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    3Expression count / 2 cannot be parameterized, because it has dependencies to/from statements that will be extracted
    4Expression count / 2 cannot be parameterized, because it has dependencies to/from statements that will be extracted