while (sb.toString().indexOf(s) == -1) {
sb.append((char) is.read());
}
while (sb.toString().indexOf(s) == -1) {
sb.append((char) is.read());
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/net/RExecTask.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/net/TelnetTask.java
|
Method name: void waitForString(String, Integer)
|
|
Method name: void waitForString(String, Integer)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | while (sb.toString().indexOf(s) == -1) {↵ | | 1 | while (sb.toString().indexOf(s) == -1) {↵
|
2 | sb.append((char) is.read());↵ | | 2 | sb.append((char) is.read());↵
|
3 | } | | 3 | }
|
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.4 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
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.1 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
5 | while (sb.toString().indexOf(s) == -1) | | 5 | while (sb.toString().indexOf(s) == -1) |
6 | sb.append((char)is.read()); | | 6 | sb.append((char)is.read()); |
Precondition Violations (0)
Row |
Violation |