File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/config/filter/FilterTransferHandler.java | File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/base/DebugRepaintManager.java | |||
Method name: boolean importData(JComponent, Transferable)
|
Method name: void printTabIndent()
|
|||
Number of AST nodes: 3 | Number of AST nodes: 2 | |||
1 | if (comp instanceof JScrollPane) {↵ | |||
2 | for (int i = 0; i < filters.length; i++) {↵ | 1 | for (int i = 0; i < ↵ | |
3 | model.addFilter((Filter) filters[i]);↵ | |||
4 | }↵ | |||
5 | ↵ | 2 | this.tabCount; i++) {↵ | |
3 | System.err.print("\t");↵ | |||
6 | } | 4 |
| |
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.3 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
21 | for (int i = 0; i < filters.length; i++) |
| 1 | for (int i = 0; i < this.tabCount; i++) | ||||||||||
| 2 | System.err.print("\t"); | ||||||||||||
22 | model.addFilter((Filter)filters[i]); |
| |
Row | Violation |
---|---|
1 | Unmatched statement model.addFilter((Filter)filters[i]); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement model.addFilter((Filter)filters[i]); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted |
3 | Clone fragment #1 returns variables i , while Clone fragment #2 returns variables |
4 | The refactoring of the clones is infeasible, because the number of macthed statements is equal to zero |