File path: /jruby-1.4.0/src/org/jruby/ext/ffi/ArrayMemoryIO.java | File path: /jruby-1.4.0/src/org/jruby/ext/ffi/ArrayMemoryIO.java | |||
Method name: int indexOf(long, byte)
|
Method name: int indexOf(long, byte, int)
|
|||
Number of AST nodes: 5 | Number of AST nodes: 5 | |||
1 | int off = index(offset);↵ | 1 | int off = index(offset);↵ | |
2 | for (int i = 0; i < length; ++i) {↵ | 2 | for (int i = 0; i < Math.min(length, maxlen); ++i) {↵ | |
3 | if (buffer[off + i] == value) {↵ | 3 | if (buffer[off + i] == value) {↵ | |
4 | return i;↵ | 4 | return i;↵ | |
5 | }↵ | 5 | }↵ | |
6 | }↵ | 6 | }↵ | |
7 | return -1; | 7 |
| |
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.4 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 9 |
Number of mapped statements | 5 |
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.7 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | int off = index(offset); | 1 | int off = index(offset); | |||||||||||
2 | for (int i = 0; i < length; ++i) |
| 2 | for (int i = 0; i < Math.min(length, maxlen); ++i) | ||||||||||
3 | if (buffer[off + i] == value) | 3 | if (buffer[off + i] == value) | |||||||||||
4 | return i; | 4 | return i; | |||||||||||
5 | return -1; | 5 | return -1; |
Row | Violation |
---|