if (reader instanceof BufferedReader) {
br = (BufferedReader) reader;
} else {
br = new BufferedReader(reader,BUFFER_INCREMENT);
}
next();
if (index > 0) move(index);
if (str instanceof BufferedInputStream) br = (BufferedInputStream) str;
else br = new BufferedInputStream(str,BUFFER_INCREMENT);
next();
if (index > 0) move(index);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedReader.java
|
|
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedInputStream.java
|
Method name: void CharIndexedReader(Reader, int)
|
|
Method name: void CharIndexedInputStream(InputStream, int)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | if (reader instanceof BufferedReader) {↵ | | 1 | if (str instanceof Buffered↵
|
2 | br = (BufferedReader) reader; ↵ | | 2 | InputStream) br = (BufferedInputStream) str;↵
|
3 | } else {↵ | | 3 | else ↵
|
4 | br = new BufferedReader(reader,BUFFER_INCREMENT);↵ | | 4 | br = new BufferedInputStream(str,BUFFER_INCREMENT);↵
|
5 | }↵ | | 5 | ↵
|
6 | next();↵ | | 6 | next();↵
|
7 | if (index > 0) move(index); | | 7 | if (index > 0) move(index);
|
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.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 8 |
-
{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) | 1.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | next(); | | 4 | next(); |
5 | if (index > 0) | | 5 | if (index > 0) |
6 | | | 6 | |
Precondition Violations (0)
Row |
Violation |