Vector<ISearchResult> v = new Vector<ISearchResult>();
Iterator<ISearchRequest> it = list.listIterator();
while (it.hasNext()) {
ISearchRequest request = it.next();
List<ISearchResult> result = query(request.getSearchTerm(), request
.getCriteria(), searchInside, startIndex, resultCount);
v.addAll(result);
}
return v;
Vector<ISearchResult> v = new Vector<ISearchResult>();
Iterator<ISearchRequest> it = list.listIterator();
while (it.hasNext()) {
ISearchRequest request = it.next();
List<ISearchResult> result = query(request.getSearchTerm(), request
.getCriteria(), searchInside, startIndex, resultCount);
v.addAll(result);
}
return v;
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/search/CalendarSearchProvider.java
|
|
File path: /columba-1.4-src/contact/src/main/java/org/columba/contact/search/ContactSearchProvider.java
|
Method name: List query(List, boolean, boolean, int, int)
|
|
Method name: List query(List, boolean, boolean, int, int)
|
Number of AST nodes: 7
|
|
Number of AST nodes: 7
|
|
1 | Vector<ISearchResult> v = new Vector<ISearchResult>();↵ | | 1 | Vector<ISearchResult> v = new Vector<ISearchResult>();↵
|
2 | Iterator<ISearchRequest> it = list.listIterator();↵ | | 2 | Iterator<ISearchRequest> it = list.listIterator();↵
|
3 | while (it.hasNext()) {↵ | | 3 | while (it.hasNext()) {↵
|
4 | ISearchRequest request = it.next();↵ | | 4 | ISearchRequest request = it.next();↵
|
|
5 | List<ISearchResult> result = query(request.getSearchTerm(), request↵ | | 5 | List<ISearchResult> result = query(request.getSearchTerm(), request↵
|
6 | .getCriteria(), searchInside, startIndex, resultCount);↵ | | 6 | .getCriteria(), searchInside, startIndex, resultCount);↵
|
|
7 | v.addAll(result);↵ | | 7 | v.addAll(result);↵
|
8 | }↵ | | 8 | }↵
|
|
9 | return v; | | 9 | return v;
|
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 |
Number of node comparisons | 25 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 7 |
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) | 7.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Vector<ISearchResult> v = new Vector<ISearchResult>(); | | 1 | Vector<ISearchResult> v = new Vector<ISearchResult>(); |
2 | Iterator<ISearchRequest> it = list.listIterator(); | | 2 | Iterator<ISearchRequest> it = list.listIterator(); |
3 | while (it.hasNext()) | | 3 | while (it.hasNext()) |
4 | ISearchRequest request = it.next(); | | 4 | ISearchRequest request = it.next(); |
5 | List<ISearchResult> result = query(request.getSearchTerm(), request.getCriteria(), searchInside, startIndex, resultCount); | | 5 | List<ISearchResult> result = query(request.getSearchTerm(), request.getCriteria(), searchInside, startIndex, resultCount); |
6 | | | 6 | |
7 | return v; | | 7 | return v; |
Precondition Violations (0)
Row |
Violation |