if (c == '=') {
lex_state = LexState.EXPR_BEG;
yaccValue = new Token("%", getPosition());
return Tokens.tOP_ASGN;
}
if (c == '=') {
lex_state = LexState.EXPR_BEG;
yaccValue = new Token("^", getPosition());
return Tokens.tOP_ASGN;
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/lexer/yacc/RubyYaccLexer.java
|
|
File path: /jruby-1.4.0/src/org/jruby/lexer/yacc/RubyYaccLexer.java
|
Method name: int percent(boolean)
|
|
Method name: int caret()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if (c == '=') {↵ | | 1 | if (c == '=') {↵
|
2 | lex_state = LexState.EXPR_BEG;↵ | | 2 | lex_state = LexState.EXPR_BEG;↵
|
3 | yaccValue = new Token("%", getPosition());↵ | | 3 | yaccValue = new Token("^", getPosition());↵
|
4 | return Tokens.tOP_ASGN;↵ | | 4 | return Tokens.tOP_ASGN;↵
|
5 | } | | 5 | }
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 16 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.8 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | if (c == '=') | | 2 | if (c == '=') |
5 | lex_state = LexState.EXPR_BEG; | | 3 | lex_state = LexState.EXPR_BEG; |
6 | yaccValue = new Token("%", getPosition()); | | 4 | yaccValue = new Token("^", getPosition()); |
7 | | | 5 | |
Precondition Violations (0)
Row |
Violation |