if ((c = src.read()) == '=') {
lex_state = LexState.EXPR_BEG;
yaccValue = new Token("<<", getPosition());
return Tokens.tOP_ASGN;
}
if ((c = src.read()) == '=') {
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 lessThan(boolean)
|
|
Method name: int greaterThan()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if ((c = src.read()) == '=') {↵ | | 1 | if ((c = src.read()) == '=') {↵
|
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.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 17 |
-
{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) | 2.5 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
16 | if ((c = src.read()) == '=') | | 8 | if ((c = src.read()) == '=') |
17 | lex_state = LexState.EXPR_BEG; | | 9 | lex_state = LexState.EXPR_BEG; |
18 | yaccValue = new Token("<<", getPosition()); | | 10 | yaccValue = new Token(">>", getPosition()); |
19 | | | 11 | |
Precondition Violations (0)
Row |
Violation |