check();
checkLazyRegexp();
return regexp.names(context);
check();
checkLazyRegexp();
return regexp;
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyMatchData.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyMatchData.java
|
Method name: IRubyObject names(ThreadContext, Block)
|
|
Method name: IRubyObject regexp(ThreadContext, Block)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | check();↵ | | 1 | check();↵
|
2 | checkLazyRegexp();↵ | | 2 | checkLazyRegexp();↵
|
3 | return regexp.names(context); | | 3 | return regexp;
|
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.0 |
Clones location | Clones are declared in the same 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 | 1 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | check(); | | 1 | check(); |
2 | checkLazyRegexp(); | | 2 | checkLazyRegexp(); |
| | | 3 | return regexp; |
3 | return regexp.names(context); | | | |
Precondition Violations (0)
Row |
Violation |