boolean retval = true;
while (retval && (index-- > 0)) retval = next();
return retval;
boolean retval = true;
while (retval && (index-- > 0)) retval = next();
return retval;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedInputStream.java
|
|
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedReader.java
|
Method name: boolean move(int)
|
|
Method name: boolean move(int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | boolean retval = true;↵ | | 1 | boolean retval = true;↵
|
2 | while (retval && (index-- > 0)) retval = next();↵ | | 2 | while (retval && (index-- > 0)) retval = next();↵
|
3 | return retval; | | 3 | return retval;
|
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 in different classes |
Number of node comparisons | 8 |
-
{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 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | boolean retval = true; | | 1 | boolean retval = true; |
2 | while (retval && (index-- > 0)) | | 2 | while (retval && (index-- > 0)) |
3 | | | 3 | |
4 | return retval; | | 4 | return retval; |
Precondition Violations (0)
Row |
Violation |