for (int i = 0; i < types.length; i++) {
if (!(assignable(types[i], args[i]) || duckable(types[i], args[i]))) {
return false;
}
}
for (int i = 0; i < types.length; i++) {
if (!(assignable(types[i], args[i]) && primitivable(types[i], args[i]))) {
return false;
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/java/dispatch/CallableSelector.java
|
|
File path: /jruby-1.4.0/src/org/jruby/java/dispatch/CallableSelector.java
|
Method name: boolean assignableOrDuckable(Class[], IRubyObject[])
|
|
Method name: boolean assignableAndPrimitivable(Class[], IRubyObject[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < types.length; i++) {↵ | | 1 | for (int i = 0; i < types.length; i++) {↵
|
2 | if (!(assignable(types[i], args[i]) || duckable(types[i], args[i]))) {↵ | | 2 | if (!(assignable(types[i], args[i]) && primitivable(types[i], args[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.4 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |