int ch = line.charAt(linePos);
linePos++;
if (linePos == line.length()) {
line = null;
}
return ch;
int ch = line.charAt(linePos);
linePos++;
if (linePos == line.length()) {
line = null;
}
return ch;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/HeadFilter.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/TokenFilter.java
|
Method name: int read()
|
|
Method name: int read()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int ch = line.charAt(linePos);↵ | | 1 | int ch = line.charAt(linePos);↵
|
2 | linePos++;↵ | | 2 | linePos++;↵
|
3 | if (linePos == line.length()) {↵ | | 3 | if (linePos == line.length()) {↵
|
4 | line = null;↵ | | 4 | line = null;↵
|
5 | }↵ | | 5 | }↵
|
6 | return ch; | | 6 | return ch;
|
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.1 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 10 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
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 | int ch = line.charAt(linePos); | | 18 | int ch = line.charAt(linePos); |
11 | linePos++; | | 19 | linePos++; |
12 | if (linePos == line.length()) | | 20 | if (linePos == line.length()) |
13 | | | 21 | |
14 | return ch; | | 22 | return ch; |
Precondition Violations (0)
Row |
Violation |