File path: /jruby-1.4.0/src/org/jruby/util/Sprintf.java | File path: /jruby-1.4.0/src/org/jruby/util/Sprintf.java | |||
Method name: int round(byte[], int, int, boolean)
|
Method name: int round(byte[], int, int, boolean)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 4 | |||
1 | if (roundPos < 0) { // "%.0f" % 0.99↵ | |||
1 | System.arraycopy(bytes,0,bytes,1,nDigits);↵ | 2 | System.arraycopy(bytes,0,bytes,1,nDigits);↵ | |
2 | bytes[0] = '1';↵ | 3 | bytes[0] = '1';↵ | |
3 | return nDigits + 1; | 4 | return nDigits + 1;↵ | |
5 |
| |||
See real code fragment | See real code fragment |
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 |
Number of mapped statements | 3 |
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 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
14 | System.arraycopy(bytes, 0, bytes, 1, nDigits); | 5 | System.arraycopy(bytes, 0, bytes, 1, nDigits); | |
15 | bytes[0] = '1'; | 6 | bytes[0] = '1'; | |
16 | return nDigits + 1; | 7 | return nDigits + 1; |
Row | Violation |
---|