bits6 = (bits24 & 0x00FC0000) >> 18;
out[outIndex++] = ALPHABET[bits6];
bits6 = (bits24 & 0x0003F000) >> 12;
out[outIndex++] = ALPHABET[bits6];
bits6 = (bits24 & 0x00FC0000) >> 18;
out[outIndex++] = ALPHABET[bits6];
bits6 = (bits24 & 0x0003F000) >> 12;
out[outIndex++] = ALPHABET[bits6];
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/Base64Converter.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/Base64Converter.java
|
Method name: String encode(byte[])
|
|
Method name: String encode(byte[])
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | bits6 = (bits24 & 0x00FC0000) >> 18;↵ | | 1 | bits6 = (bits24 & 0x00FC0000) >> 18;↵
|
2 | out[outIndex++] = ALPHABET[bits6];↵ | | 2 | out[outIndex++] = ALPHABET[bits6];↵
|
3 | bits6 = (bits24 & 0x0003F000) >> 12;↵ | | 3 | bits6 = (bits24 & 0x0003F000) >> 12;↵
|
4 | out[outIndex++] = ALPHABET[bits6]; | | 4 | out[outIndex++] = ALPHABET[bits6];
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in the same method |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
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) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
21 | bits6 = (bits24 & 0x00FC0000) >> 18; | | 30 | bits6 = (bits24 & 0x00FC0000) >> 18; |
22 | out[outIndex++] = ALPHABET[bits6]; | | 31 | out[outIndex++] = ALPHABET[bits6]; |
23 | bits6 = (bits24 & 0x0003F000) >> 12; | | 32 | bits6 = (bits24 & 0x0003F000) >> 12; |
24 | out[outIndex++] = ALPHABET[bits6]; | | 33 | out[outIndex++] = ALPHABET[bits6]; |
Precondition Violations (0)
Row |
Violation |