while (exStr.hasMoreTokens()) {
if (DirectoryScanner.match(exStr.nextToken(), pName)) {
return true;
}
}
while (exStr.hasMoreTokens()) {
if (DirectoryScanner.match(exStr.nextToken(), pName)) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/scm/AntStarTeamCheckOut.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/starteam/TreeBasedTask.java
|
Method name: boolean matchPatterns(String, String)
|
|
Method name: boolean matchPatterns(String, String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | while (exStr.hasMoreTokens()) {↵ | | 1 | while (exStr.hasMoreTokens()) {↵
|
2 | if (DirectoryScanner.match(exStr.nextToken(), pName)) {↵ | | 2 | if (DirectoryScanner.match(exStr.nextToken(), pName)) {↵
|
3 | return true;↵ | | 3 | return true;↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
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.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 5 |
-
{Non-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) | 0.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | while (exStr.hasMoreTokens()) | | 4 | while (exStr.hasMoreTokens()) |
5 | if (DirectoryScanner.match(exStr.nextToken(), pName)) | | 5 | if (DirectoryScanner.match(exStr.nextToken(), pName)) |
6 | | | 6 | |
Precondition Violations (2)
Row |
Violation |
1 | Conditional return true; |
2 | Conditional return true; |