File path: /sql12/plugins/dbcopy/src/net/sourceforge/squirrel_sql/plugins/dbcopy/util/DBUtil.java | File path: /sql12/plugins/refactoring/src/net/sourceforge/squirrel_sql/plugins/refactoring/commands/DropPrimaryKeyCommand.java | |||
Method name: boolean containsTable(List
|
Method name: TableColumnInfo[] getPkTableColumns(ITableInfo)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 2 | |||
1 | if (table.equalsIgnoreCase(ti.getSimpleName()))↵ | 1 | if (colInfo.getSimpleName().equals(pkColName))↵ | |
2 | {↵ | 2 | {↵ | |
3 | result = true;↵ | 3 | result↵ | |
4 | break;↵ | 4 | .add(colInfo);↵ | |
5 | } | 5 | } | |
See real code fragment | See real code fragment |
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.4 |
Clones location | Clones are in different classes |
Number of node comparisons | 7 |
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 2 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 34.1 |
Clone type | Type 3 |
ID | Statement | ID | Statement | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3 | if (table.equalsIgnoreCase(ti.getSimpleName())) |
| 7 | if (colInfo.getSimpleName().equals(pkColName)) | ||||||||||||||||
4 | result = true; | | ||||||||||||||||||
5 | break; |
| | |||||||||||||||||
|
| 8 | result.add(colInfo); |
Row | Violation |
---|---|
1 | Unmatched break; |
2 | Unmatched statement result.add(colInfo); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted |
3 | The refactoring of the clones is infeasible, because the number of macthed statements is equal to zero |