for (int i = 0; i < uids.length; i++) { SearchIndex idx = new SearchIndex(folder, uids[i]); // System.out.println("--> idx.folder="+idx.folder.getId()); // System.out.println("--> idx.message="+idx.messageId); indizes.add(idx); } // retrieve the actual search result data List<ISearchResult> l = retrieveResultData(indizes, startIndex, resultCount); result.addAll(l); // sort all the results Collections.sort(result, new MyComparator()); // remember search folder for "show total results" action searchFolders.put(searchRequestId, folder); lastSearchFolder = folder;
for (int i = 0; i < uids.length; i++) { SearchIndex idx = new SearchIndex(folder, uids[i]); // System.out.println("--> idx.folder="+idx.folder.getId()); // System.out.println("--> idx.message="+idx.messageId); indizes.add(idx); } // retrieve the actual search result data List<ISearchResult> l = retrieveResultData(indizes, startIndex, resultCount); result.addAll(l); // sort all the results Collections.sort(result, new MyComparator()); // remember search folder for "show total results" action searchFolders.put(searchRequestId, folder); lastSearchFolder = folder;
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/search/MailSearchProvider.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/search/MailSearchProvider.java
Method name: List query(String, String, boolean, int, int) Method name: List query(List, boolean, boolean, int, int)
Number of AST nodes: 8 Number of AST nodes: 8
1
for (int i = 0; i < uids.length; i++) {
1
for (int i = 0; i < uids.length; i++) {
2
				SearchIndex idx = new SearchIndex(folder, uids[i]);
2
				SearchIndex idx = new SearchIndex(folder, uids[i]);
3
//				System.out.println("--> idx.folder="+idx.folder.getId());
3
//				System.out.println("--> idx.folder="+idx.folder.getId());
4
//				System.out.println("--> idx.message="+idx.messageId);
4
//				System.out.println("--> idx.message="+idx.messageId);
5
				indizes.add(idx);
5
				indizes.add(idx);
6
			}
6
			}
7
			// retrieve the actual search result data
7
			// retrieve the actual search result data
8
			List<ISearchResult> l = retrieveResultData(indizes, startIndex,
8
			List<ISearchResult> l = retrieveResultData(indizes, startIndex,
9
					resultCount);
9
					resultCount);
10
			result.addAll(l);
10
			result.addAll(l);
11
			// sort all the results
11
			// sort all the results
12
			Collections.sort(result, new MyComparator());
12
			Collections.sort(result, new MyComparator());
13
			// remember search folder for "show total results" action
13
			// remember search folder for "show total results" action
14
			searchFolders.put(searchRequestId, folder);
14
			searchFolders.put(searchRequestId, folder);
15
			lastSearchFolder = folder;
15
			lastSearchFolder = folder;
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.3
Clones locationClones are declared in the same class
Number of node comparisons27
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements8
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)7.2
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    27
    for (int i = 0; i < uids.length; i++)
    28
    for (int i = 0; i < uids.length; i++)
    28
    SearchIndex idx = new SearchIndex(folder, uids[i]);
    29
    SearchIndex idx = new SearchIndex(folder, uids[i]);
    29
    indizes.add(idx);
    30
    indizes.add(idx);
    30
    List<ISearchResult> l = retrieveResultData(indizes, startIndex, resultCount);
    31
    List<ISearchResult> l = retrieveResultData(indizes, startIndex, resultCount);
    31
    result.addAll(l);
    32
    result.addAll(l);
    32
    Collections.sort(result, new MyComparator());
    33
    Collections.sort(result, new MyComparator());
    33
    searchFolders.put(searchRequestId, folder);
    34
    searchFolders.put(searchRequestId, folder);
    34
    lastSearchFolder = folder;
    35
    lastSearchFolder = folder;
    Precondition Violations (0)
    Row Violation