for (int i = 0; i < len >> 1; i++) {
byte b = bytes[p + i];
bytes[p + i] = bytes[p + len - i - 1];
bytes[p + len - i - 1] = b;
}
for (int i = 0; i < len >> 1; i++) {
byte b = bytes[p + i];
bytes[p + i] = bytes[p + len - i - 1];
bytes[p + len - i - 1] = b;
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyString.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyString.java
|
Method name: RubyString reverse_bang19(ThreadContext)
|
|
Method name: RubyString reverse_bang(ThreadContext)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < len >> 1; i++) {↵ | | 1 | for (int i = 0; i < len >> 1; i++) {↵
|
2 | byte b = bytes[p + i];↵ | | 2 | byte b = bytes[p + i];↵
|
3 | bytes[p + i] = bytes[p + len - i - 1];↵ | | 3 | bytes[p + i] = bytes[p + len - i - 1];↵
|
4 | bytes[p + len - i - 1] = b;↵ | | 4 | bytes[p + len - i - 1] = b;↵
|
5 | } | | 5 | }
|
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.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 17 |
-
{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) | 1.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | for (int i = 0; i < len >> 1; i++) | | 6 | for (int i = 0; i < len >> 1; i++) |
9 | | | 7 | |
10 | bytes[p + i] = bytes[p + len - i - 1]; | | 8 | bytes[p + i] = bytes[p + len - i - 1]; |
11 | bytes[p + len - i - 1] = b; | | 9 | bytes[p + len - i - 1] = b; |
Precondition Violations (0)
Row |
Violation |