mgr.buffer.insert(offset,str);
if(mgr.redoClearDirty == this)
mgr.buffer.setDirty(false);
return offset + length;
mgr.buffer.insert(offset,str);
if(mgr.undoClearDirty == this)
mgr.buffer.setDirty(false);
return offset + length;
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: int redo()
|
|
Method name: int undo()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | mgr.buffer.insert(offset,str);↵ | | 1 | mgr.buffer.insert(offset,str);↵
|
2 | if(mgr.redoClearDirty == this)↵ | | 2 | if(mgr.undoClearDirty == this)↵
|
3 | mgr.buffer.setDirty(false);↵ | | 3 | mgr.buffer.setDirty(false);↵
|
4 | return offset + length; | | 4 | return offset + length;
|
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 the same java file |
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.7 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | mgr.buffer.insert(offset, str); | | 1 | mgr.buffer.insert(offset, str); |
2 | if (mgr.redoClearDirty == this) | | 2 | if (mgr.undoClearDirty == this) |
3 | mgr.buffer.setDirty(false); | | 3 | mgr.buffer.setDirty(false); |
4 | return offset + length; | | 4 | return offset + length; |
Precondition Violations (0)
Row |
Violation |