for (Iterator iter = c.iterator(); iter.hasNext();) {
if (indexOf(iter.next()) == -1) {
return false;
}
}
for (int i = 0; i < parameterTypes.length; ++i) {
if (!isFastLongParam(parameterTypes[i])) {
return false;
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyArray.java
|
|
File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/FastLongMethodFactory.java
|
Method name: boolean containsAll(Collection)
|
|
Method name: boolean isFastLongMethod(Type, Type[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (Iterator iter = c.iterator(); iter.hasNext();) {↵ | | 1 | for (↵
|
2 | if (indexOf(iter.next()) == -1↵ | | 2 | int i = 0; i < parameterTypes.length; ++i) {↵
|
3 | ) {↵ | | 3 | if (!isFastLongParam(parameterTypes[i])) {↵
|
4 | return false;↵ | | 4 | return false;↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 6 | }
|
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 |