Buffer buffer = this.buffer.getPrev();
if(buffer == null)
setBuffer(jEdit.getLastBuffer());
else
setBuffer(buffer);
Buffer buffer = this.buffer.getNext();
if(buffer == null)
setBuffer(jEdit.getFirstBuffer());
else
setBuffer(buffer);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/EditPane.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/EditPane.java
|
Method name: void prevBuffer()
|
|
Method name: void nextBuffer()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | Buffer buffer = this.buffer.getPrev();↵ | | 1 | Buffer buffer = this.buffer.getNext();↵
|
2 | if(buffer == null)↵ | | 2 | if(buffer == null)↵
|
3 | setBuffer(jEdit.getLastBuffer());↵ | | 3 | setBuffer(jEdit.getFirstBuffer());↵
|
4 | else↵ | | 4 | else↵
|
5 | setBuffer(buffer); | | 5 | setBuffer(buffer);
|
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 declared in the same class |
Number of node comparisons | 10 |
-
{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) | 1.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Buffer buffer = this.buffer.getPrev(); | | 1 | Buffer buffer = this.buffer.getNext(); |
2 | if (buffer == null) | | 2 | if (buffer == null) |
3 | setBuffer(jEdit.getLastBuffer()); | | 3 | setBuffer(jEdit.getFirstBuffer()); |
| | | | |
4 | | | 4 | |
Precondition Violations (0)
Row |
Violation |