Iterator<ISearchResult> it = result.iterator();
while (it.hasNext()) {
listModel.addElement(it.next());
}
Iterator<ISearchResult> it = result.iterator();
while (it.hasNext()) {
listModel.addElement(it.next());
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/search/SearchResultList.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/search/ResultList.java
|
Method name: void addAll(List)
|
|
Method name: void addAll(List)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | Iterator<ISearchResult> it = result.iterator();↵ | | 1 | Iterator<ISearchResult> it = result.iterator();↵
|
2 | while (it.hasNext()) {↵ | | 2 | while (it.hasNext()) {↵
|
3 | listModel.addElement(it.next());↵ | | 3 | listModel.addElement(it.next());↵
|
4 | } | | 4 | }
|
See real code fragment |
|
See real code fragment |
Summary
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.1 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
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) | 18.8 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Iterator<ISearchResult> it = result.iterator(); | | 1 | Iterator<ISearchResult> it = result.iterator(); |
2 | while (it.hasNext()) | | 2 | while (it.hasNext()) |
3 | listModel.addElement(it.next()); | | 3 | listModel.addElement(it.next()); |
Precondition Violations (0)
Row |
Violation |