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 justifyCommon(Ruby, ByteList, int, int)
|
Method name: RubyString justifyCommon(Ruby, ByteList, int, int)
|
|||
Number of AST nodes: 2 | Number of AST nodes: 2 | |||
1 | while (p < end) {↵ | 1 | while (p < end) {↵ | |
2 | bytes[p++] = padBytes[padP];↵ | 2 | bytes[p++] = padBytes[padP];↵ | |
3 | } | 3 |
| |
See real code fragment | See real code fragment |
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.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 7 |
Number of mapped statements | 2 |
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.9 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
27 | while (p < end) | 14 | while (p < end) | |
28 | bytes[p++] = padBytes[padP]; | 15 | bytes[p++] = padBytes[padP]; |
Row | Violation |
---|---|
1 | Clone fragment #1 returns variables , while Clone fragment #2 returns variables bytes, p |