for (int i = 0; i < parameterTypes.length; ++i) {
if (!isFastIntParam(parameterTypes[i])) {
return false;
}
}
for (int i = 1; i < s.length(); i++) {
if (!isIdentChar(s.charAt(i))) {
return false;
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/FastIntMethodFactory.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubySymbol.java
|
Method name: boolean isFastIntMethod(Type, Type[])
|
|
Method name: boolean isIdentifier(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < parameterTypes.length; ++i) {↵ | | 1 | for (int i = 1; i < s.length(); i++) {↵
|
2 | if (!isFastIntParam(parameterTypes[i])) {↵ | | 2 | if (!isIdentChar(s.charAt(i))) {↵
|
3 | return false;↵ | | 3 | return false;↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |