File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/FastIntMethodFactory.java | File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/FastLongMethodFactory.java | |||
Method name: boolean isFastIntMethod(Type, Type[])
|
Method name: boolean isFastLongMethod(Type, Type[])
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | for (int i = 0; i < parameterTypes.length; ++i) {↵ | 1 | for (int i = 0; i < parameterTypes.length; ++i) {↵ | |
2 | if (!isFastIntParam(parameterTypes[i])) {↵ | 2 | if (!isFastLongParam(parameterTypes[i])) {↵ | |
3 | return false;↵ | 3 | return false;↵ | |
4 | }↵ | 4 | }↵ | |
5 | } | 5 |
| |
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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
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.5 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | for (int i = 0; i < parameterTypes.length; ++i) | 1 | for (int i = 0; i < parameterTypes.length; ++i) | |||||||||||||
2 | if (!isFastIntParam(parameterTypes[i])) |
| 2 | if (!isFastLongParam(parameterTypes[i])) | ||||||||||||
3 | return false; | 3 | return false; |
Row | Violation |
---|---|
1 | Expression isFastIntParam(parameterTypes[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression isFastLongParam(parameterTypes[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |