File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/parser/MailUrlParser.java | File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/parser/MailUrlParser.java | |||
Method name: Map parse(String)
|
Method name: Map parse(String)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | for(int i=0; i<addresses.length; i++ ) {↵ | 1 | for(int i=0; i<addresses.length; i++ ) {↵ | |
2 | addressList.add(addresses[i].toString());↵ | 2 | addressList.add(addresses[i].toString());↵ | |
3 | }↵ | 3 | }↵ | |
4 | result.put("bcc", addressList.toArray(new String[0])); | 4 | result.put("cc", addressList.toArray(new String[0])); | |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 6 |
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 3.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
36 | for (int i = 0; i < addresses.length; i++) | 30 | for (int i = 0; i < addresses.length; i++) | |||||||||||
37 | addressList.add(addresses[i].toString()); | 31 | addressList.add(addresses[i].toString()); | |||||||||||
38 | result.put("bcc", addressList.toArray(new String[0])); |
| 32 | result.put("cc", addressList.toArray(new String[0])); |
Row | Violation |
---|