while (Calendar.getInstance().before(endTime) && is.available() == 0) {
Thread.sleep(250);
}
while (Calendar.getInstance().before(endTime)
&& is.available() == 0) {
Thread.sleep(250);
}
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 waitForEOF(Integer)
|
|
Method name: void waitForString(String, Integer)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | while (Calendar.getInstance().before(endTime)↵ | | 1 | while (Calendar.getInstance().before(endTime)↵
|
2 | && is.available() == 0) {↵ | | 2 | && is.available() == 0) {↵
|
3 | Thread.sleep(250);↵ | | 3 | Thread.sleep(250);↵
|
4 | } | | 4 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.6 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 6 |
-
{Non-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) | 2.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
16 | while (Calendar.getInstance().before(endTime) && is.available() == 0) | | 10 | while (Calendar.getInstance().before(endTime) && is.available() == 0) |
17 | | | 11 | |
Precondition Violations (1)
Row |
Violation |
1 | The refactoring of the clones is infeasible, because classes org.apache.tools.ant.taskdefs.optional.net.RExecTask.AntRExecClient and org.apache.tools.ant.taskdefs.optional.net.TelnetTask.AntTelnetClient do not have a common superclass |