if ((c = src.read()) == '=') {
lex_state = LexState.EXPR_BEG;
yaccValue = new Token("||", getPosition());
return Tokens.tOP_ASGN;
}
if (!isOneEight && c == '>') {
lex_state = LexState.EXPR_ARG;
yaccValue = new Token("->", getPosition());
return Tokens.tLAMBDA;
}
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 pipe()
|
|
Method name: int minus(boolean)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if ((c = src.read()) == '=') {↵ | | 1 | if (!isOneEight && c == '>') {↵
|
2 | lex_state = LexState.EXPR_BEG;↵ | | 2 | lex_state = LexState.EXPR_ARG;↵
|
3 | yaccValue = new Token("||", getPosition());↵ | | 3 | yaccValue = new Token("->", getPosition());↵
|
4 | return Tokens.tOP_ASGN;↵ | | 4 | return Tokens.t↵
|
5 | ↵ | | 5 | LAMBDA;↵
|
6 | } | | 6 | }
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |