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; // switch
case 'e':
case 'E':
state = SEXP;
break states;
case '_':
break; // switch
default:
state = SCOMPLETE;
break states;
} // switch
}
if ( 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; // switch
default:
state = SCOMPLETE;
break states;
} // switch
}
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: 24
|
|
Number of AST nodes: 18
|
|
1 | for ( ; i < buflen ; ) {↵ | | 1 | if ( i < buflen) {↵
|
2 | switch(ival = bytes[i++]) {↵ | | 2 | switch(ival = bytes[i++]) {↵
|
3 | case '0': case '1': case '2': case '3': case '4':↵ | | 3 | case '0': case '1': case '2': case '3': case '4':↵
|
4 | case '5': case '6': case '7': case '8': case '9':↵ | | 4 | case '5': case '6': case '7': case '8': case '9':↵
|
5 | chars[offset++] = (char)ival;↵ | | 5 | chars[offset++] = (char)ival;↵
|
6 | lastValidOffset = offset;↵ | | 6 | lastValidOffset = offset;↵
|
7 | break; // switch↵ | | 7 | break; // switch↵
|
8 | case 'e':↵ | | |
|
9 | case 'E':↵ | | |
|
10 | state = SEXP;↵ | | |
|
11 | break states;↵ | | |
|
12 | case '_':↵ | | |
|
13 | break; // switch↵ | | |
|
14 | default:↵ | | 8 | default:↵
|
15 | state = SCOMPLETE;↵ | | 9 | state = SCOMPLETE;↵
|
16 | break states;↵ | | 10 | break states;↵
|
17 | } // switch↵ | | 11 | } // switch↵
|
18 | } | | 12 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in the same method |
Number of node comparisons | 167 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 17 |
Number of unmapped statements in the first code fragment | 6 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 12.6 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
539 | switch (ival = bytes[i++]) | | 521 | switch (ival = bytes[i++]) |
540 | | | 522 | |
541 | | | 523 | |
542 | | | 524 | |
543 | | | 525 | |
544 | | | 526 | |
545 | | | 527 | |
546 | | | 528 | |
547 | | | 529 | |
548 | | | 530 | |
549 | | | 531 | |
550 | chars[offset++] = (char)ival; | | 532 | chars[offset++] = (char)ival; |
551 | lastValidOffset = offset; | | 533 | lastValidOffset = offset; |
552 | | | 534 | |
553 | | | | |
554 | | | | |
555 | | | | |
556 | | | | |
557 | | | | |
558 | | | | |
559 | | | 535 | |
560 | | | 536 | |
561 | | | 537 | |
Precondition Violations (4)
Row |
Violation |
1 | Unmatched statement state=SEXP; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched break states; |
3 | Unmatched break; |
4 | Clone fragment #1 returns variables i, ival, offset, chars, lastValidOffset , while Clone fragment #2 returns variables i, ival, offset, chars, lastValidOffset |