File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/tree/util/TreeNodeList.java | File path: /columba-1.4-src/contact/src/test/java/org/columba/addressbook/folder/AbstractFolderTstCase.java | |||
Method name: void TreeNodeList(String[])
|
Method name: void tearDown()
|
|||
Number of AST nodes: 2 | Number of AST nodes: 3 | |||
1 | if (list != null) {↵ | |||
1 | for (int i = 0; i < str.length; i++) {↵ | 2 | for (int i = 0; i < list.length; i++) {↵ | |
2 | list.add(str[i]);↵ | |||
3 | ↵ | |||
3 | list[i].delete();↵ | |||
4 | }↵ | |||
4 | } | 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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 4 |
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) | 1.0 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | for (int i = 0; i < str.length; i++) |
| 6 | for (int i = 0; i < list.length; i++) | ||||||||||||||
2 | list.add(str[i]); |
| | |||||||||||||||
|
| 7 | list[i].delete(); |
Row | Violation |
---|---|
1 | Type int of variable str.length does not match with type int of variable list.length |
2 | Unmatched statement list.add(str[i]); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
3 | Unmatched statement list[i].delete(); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
4 | The refactoring of the clones is infeasible, because the number of macthed statements is equal to zero |