for (int i = top; i > saveIndex; --i)
{
if (!(commandList.get(i) instanceof AbstractCommand.NonDirtying))
{
return true;
}
}
for (int i = saveIndex; i > top; --i)
{
if (!(commandList.get(i) instanceof AbstractCommand.NonDirtying))
{
return true;
}
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/command/BasicCommandStack.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/common/command/BasicCommandStack.java
|
Method name: boolean isSaveNeeded()
|
|
Method name: boolean isSaveNeeded()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = top; i > saveIndex; --i)↵ | | 1 | for (int i = saveIndex; i > top; --i)↵
|
2 | {↵ | | 2 | {↵
|
3 | if (!(commandList.get(i) instanceof AbstractCommand.NonDirtying))↵ | | 3 | if (!(commandList.get(i) instanceof AbstractCommand.NonDirtying))↵
|
4 | {↵ | | 4 | {↵
|
5 | return true;↵ | | 5 | return true;↵
|
6 | }↵ | | 6 | }↵
|
7 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in the same method |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 3 |
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.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | for (int i = top; i > saveIndex; --i) | | 7 | for (int i = saveIndex; i > top; --i) |
5 | if (!(commandList.get(i) instanceof AbstractCommand.NonDirtying)) | | 8 | if (!(commandList.get(i) instanceof AbstractCommand.NonDirtying)) |
6 | | | 9 | |
Precondition Violations (2)
Row |
Violation |
1 | Conditional return true; |
2 | Conditional return true; |