File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/AntTest.java | File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java | |||
Method name: void targetStarted(BuildEvent)
|
Method name: boolean isResponseOK(String, int[])
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | for (int i=0; i<l1.length; i++) {↵ | 1 | for (int i = 0; i < ok.length; i++) {↵ | |
2 | if (!l1[i].equals(l2[i])) {↵ | 2 | ↵ | |
3 | assertTrue(msg, !shouldBeEqual);↵ | |||
4 | }↵ | |||
5 | ↵ | 3 | if (response.startsWith("" + ok[i])) {↵ | |
4 | return true;↵ | |||
5 | }↵ | |||
6 | } | 6 |
| |
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 | 5 |
Number of mapped statements | 2 |
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.4 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
19 | for (int i = 0; i < l1.length; i++) |
| 1 | for (int i = 0; i < ok.length; i++) | ||||||||||||||
20 | if (!l1[i].equals(l2[i])) |
| 2 | if (response.startsWith("" + ok[i])) | ||||||||||||||
|
| 3 | return true; | |||||||||||||||
21 | assertTrue(msg, !shouldBeEqual); | |
Row | Violation |
---|---|
1 | Type java.lang.String[] of variable l1 does not match with type int[] of variable ok |
2 | Expression !l1[i].equals(l2[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Expression response.startsWith("" + ok[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
4 | Unmatched return true; |