nextReader();
if (fixLastLine && isMissingEndOfLine()) {
needAddSeparator = true;
lastPos = 0;
}
nextReader();
if (fixLastLine && isMissingEndOfLine()) {
needAddSeparator = true;
lastPos = 0;
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Concat.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Concat.java
|
Method name: int read()
|
|
Method name: int read(char[], int, int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | nextReader();↵ | | 1 | nextReader();↵
|
2 | if (fixLastLine && isMissingEndOfLine()) {↵ | | 2 | if (fixLastLine && isMissingEndOfLine()) {↵
|
3 | needAddSeparator = true;↵ | | 3 | needAddSeparator = true;↵
|
4 | lastPos = 0;↵ | | 4 | lastPos = 0;↵
|
5 | } | | 5 | }
|
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 | 12 |
-
{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 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | nextReader(); | | 16 | nextReader(); |
11 | if (fixLastLine && isMissingEndOfLine()) | | 17 | if (fixLastLine && isMissingEndOfLine()) |
12 | | | 18 | |
13 | | | 19 | |
Precondition Violations (0)
Row |
Violation |