for ( ; i < buflen; ) { switch(ival = bytes[i++]) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': chars[offset++] = (char)ival; lastValidOffset = offset; break; case '_': break; default: state = SCOMPLETE; break states; } }
switch(ival = bytes[i++]) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': chars[offset++] = (char)ival; lastValidOffset = offset; break; //switch default: state = SERR_NOT_STRICT; break states; }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/util/Convert.java File path: /jruby-1.4.0/src/org/jruby/util/Convert.java
Method name: double byteArrayToDouble(byte[], int, int, boolean) Method name: double byteArrayToDouble(byte[], int, int, boolean)
Number of AST nodes: 20 Number of AST nodes: 17
1
for ( ; i < buflen; ) {
2
                    switch(ival = bytes[i++]) {
1
switch(ival = bytes[i++]) {
3
                    case '0': case '1': case '2': case '3': case '4':
2
                    case '0': case '1': case '2': case '3': case '4':
4
                    case '5': case '6': case '7': case '8': case '9':
3
                    case '5': case '6': case '7': case '8': case '9':
5
                        chars[offset++] = (char)ival;
4
                        chars[offset++] = (char)ival;
6
                        lastValidOffset = offset;
5
                        lastValidOffset = offset;
7
                        break;
6
                        break;
8
                    case '_':
9
                        break;
7
 //switch
10
                    default:
8
                    default:
11
                        state = SCOMPLETE;
9
                        state = SERR_NOT_STRICT;
12
                        break states;
10
                        break states;
13
                    }
11
                    }
14
                }
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 comparisons155
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements17
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)15.9
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    579
    switch (ival = bytes[i++])
    725
    switch (ival = bytes[i++])
    580
    case '0':
    726
    case '0':
    581
    case '1':
    727
    case '1':
    582
    case '2':
    728
    case '2':
    583
    case '3':
    729
    case '3':
    584
    case '4':
    730
    case '4':
    585
    case '5':
    731
    case '5':
    586
    case '6':
    732
    case '6':
    587
    case '7':
    733
    case '7':
    588
    case '8':
    734
    case '8':
    589
    case '9':
    735
    case '9':
    590
    chars[offset++] = (char)ival;
    736
    chars[offset++] = (char)ival;
    591
    lastValidOffset = offset;
    737
    lastValidOffset = offset;
    592
    break;
    738
    break;
    593
    case '_':
                                
    594
    break;
    594
    break;
    Preondition Violations
    Unmatched break;
                          
    595
    default:
    739
    default:
    596
    state = SCOMPLETE;
    596
    state = SCOMPLETE;
    740
    state = SERR_NOT_STRICT;
    Differences
    Expression1Expression2Difference
    SCOMPLETESERR_NOT_STRICTVARIABLE_NAME_MISMATCH
    740
    state = SERR_NOT_STRICT;
    597
    break states;
    741
    break states;
    Precondition Violations (2)
    Row Violation
    1Unmatched break;
    2Clone fragment #1 returns variables i, ival, offset, chars, lastValidOffset , while Clone fragment #2 returns variables i, ival, offset, chars, lastValidOffset