for (int i = 0; i < args.length; ++i) {
marshallers[i].marshal(invocation, buffer, args[i]);
}
return functionInvoker.invoke(context.getRuntime(), function, buffer);
for (int i = 0; i < args.length; ++i) {
marshallers[i].marshal(invocation, buffer, args[i]);
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/DefaultMethod.java
|
|
File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/CallbackMethodWithBlock.java
|
Method name: IRubyObject call(ThreadContext, IRubyObject, RubyModule, String, IRubyObject[], Block)
|
|
Method name: IRubyObject call(ThreadContext, IRubyObject, RubyModule, String, IRubyObject[], Block)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 2
|
|
1 | for (int i = 0; i < args.length; ++i) {↵ | | 1 | for (int i = 0; i < args.length; ++i) {↵
|
2 | marshallers[i].marshal(invocation, buffer, args[i]);↵ | | 2 | marshallers[i].marshal(invocation, buffer, args[i]);↵
|
3 | }↵ | | 3 | }
|
4 | return functionInvoker.invoke(context.getRuntime(), function, buffer); | | | |
See real code fragment |
|
See real code fragment |
Summary
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.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.5 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
6 | for (int i = 0; i < args.length; ++i) | | 7 | for (int i = 0; i < args.length; ++i) |
7 | marshallers[i].marshal(invocation, buffer, args[i]); | | 8 | marshallers[i].marshal(invocation, buffer, args[i]); |
Precondition Violations (0)
Row |
Violation |