for (int i = 0; i < _exts.length; ++i) {
if (name.endsWith(_exts[i])) {
return true;
}
}
if (!_closing)
{
_logContentsTxt.append(finalLine);
}
Clone fragments detected by clone detection tool
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/util/FileExtensionFilter.java
|
|
File path: /sql12/app/src/net/sourceforge/squirrel_sql/client/gui/ViewLogsSheet.java
|
Method name: boolean checkFileName(String)
|
|
Method name: void run()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 2
|
|
1 | for (int i = 0; i < _exts.length; ++i) {↵ | | |
|
2 | if (name.endsWith(_exts[i])) {↵ | | |
|
3 | return true;↵ | | |
|
| | | 1 | if (!_closing)↵
|
| | | 2 | {↵
|
| | | 3 | _logContentsTxt.append(finalLine);↵
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 4 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.7 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | if (name.endsWith(_exts[i])) | | 1 | if (!_closing) |
| | | 2 | _logContentsTxt.append(finalLine); |
3 | | | | |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched return true; |
2 | The refactoring of the clones is infeasible, because the number of macthed statements is equal to zero |