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;
}
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: 17
|
|
Number of AST nodes: 18
|
|
| | | 1 | if ( i < buflen) {↵
|
1 | switch(ival = bytes[i++]) {↵ | | 2 | switch(ival = bytes[i++]) {↵
|
2 | case '0': case '1': case '2': case '3': case '4':↵ | | 3 | case '0': case '1': case '2': case '3': case '4':↵
|
3 | case '5': case '6': case '7': case '8': case '9':↵ | | 4 | case '5': case '6': case '7': case '8': case '9':↵
|
4 | chars[offset++] = (char)ival;↵ | | 5 | chars[offset++] = (char)ival;↵
|
5 | lastValidOffset = offset;↵ | | 6 | lastValidOffset = offset;↵
|
6 | break; //switch↵ | | 7 | break; // switch↵
|
7 | default:↵ | | 8 | default:↵
|
8 | state = SERR_NOT_STRICT;↵ | | 9 | state = SCOMPLETE;↵
|
9 | break states;↵ | | 10 | break states;↵
|
10 | } | | 11 | } // switch↵
|
| | | 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.7 |
Clones location | Clones are in the same method |
Number of node comparisons | 148 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 17 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 17.1 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
725 | switch (ival = bytes[i++]) | | 521 | switch (ival = bytes[i++]) |
726 | | | 522 | |
727 | | | 523 | |
728 | | | 524 | |
729 | | | 525 | |
730 | | | 526 | |
731 | | | 527 | |
732 | | | 528 | |
733 | | | 529 | |
734 | | | 530 | |
735 | | | 531 | |
736 | chars[offset++] = (char)ival; | | 532 | chars[offset++] = (char)ival; |
737 | lastValidOffset = offset; | | 533 | lastValidOffset = offset; |
738 | | | 534 | |
739 | | | 535 | |
740 | | | 536 | |
741 | | | 537 | |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables i, ival, offset, chars, lastValidOffset , while Clone fragment #2 returns variables i, ival, offset, chars, lastValidOffset |