edit.prev = last;
last.next = edit;
last = edit;
undosLast.next = edit;
edit.prev = undosLast;
undosLast = edit;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/buffer/UndoManager.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/buffer/UndoManager.java
|
Method name: void add(Edit)
|
|
Method name: void addEdit(Edit)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | edit.prev = last;↵ | | |
|
2 | last.next = edit;↵ | | |
|
3 | l↵ | | 1 | undosLast.next = edit;↵
|
| | | 2 | edit.prev = undosLast;↵
|
4 | ast = edit; | | 3 | undosLast = edit;
|
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.0 |
Clones location | Clones are in the same java file |
Number of node comparisons | 5 |
-
{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.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | edit.prev = last; | | 4 | edit.prev = undosLast; |
4 | last.next = edit; | | 3 | undosLast.next = edit; |
5 | last = edit; | | 5 | undosLast = edit; |
Precondition Violations (0)
Row |
Violation |