for (c = read(); c != '\n' && c != RubyYaccLexer.EOF; c = read()) {}
return c;
for (c = read(); c != '\n' && c != RubyYaccLexer.EOF; c = read()) {}
return c;
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/lexer/yacc/ByteListLexerSource.java
|
|
File path: /jruby-1.4.0/src/org/jruby/lexer/yacc/InputStreamLexerSource.java
|
Method name: int skipUntil(int)
|
|
Method name: int skipUntil(int)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | for (c = read(); c != '\n' && c != RubyYaccLexer.EOF; c = read()) {}↵ | | 1 | for (c = read(); c != '\n' && c != RubyYaccLexer.EOF; c = read()) {}↵
|
2 | ↵ | | 2 | ↵
|
3 | return c; | | 3 | return c;
|
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.3 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 2 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
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) | 3.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | for (c = read(); c != '\n' && c != RubyYaccLexer.EOF; c = read()) | | 1 | for (c = read(); c != '\n' && c != RubyYaccLexer.EOF; c = read()) |
2 | return c; | | 2 | return c; |
Precondition Violations (0)
Row |
Violation |