1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
/*******************************************************************************
* Copyright (c) 2000, 2016 IBM Corporation and others.
*
* This program and the accompanying materials
* are made available under the terms of the Eclipse Public License 2.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-2.0/
*
* SPDX-License-Identifier: EPL-2.0
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.search.tests.filesearch;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import java.util.ArrayList;
import java.util.List;
import org.junit.Before;
import org.junit.ClassRule;
import org.junit.Test;
import org.eclipse.search.internal.ui.text.FileSearchQuery;
import org.eclipse.search.ui.NewSearchUI;
import org.eclipse.search.ui.text.AbstractTextSearchResult;
import org.eclipse.search.ui.text.FileTextSearchScope;
import org.eclipse.search.ui.text.Match;
public class SortingTest {
FileSearchQuery fQuery1;
@ClassRule
public static JUnitSourceSetup fgJUnitSource= new JUnitSourceSetup();
@Before
public void setUp() throws Exception {
String[] fileNamePatterns= { "*.java" };
FileTextSearchScope scope= FileTextSearchScope.newWorkspaceScope(fileNamePatterns, false);
fQuery1= new FileSearchQuery("Test", false, true, scope);
}
@Test
public void testSorted() throws Exception {
NewSearchUI.activateSearchResultView();
NewSearchUI.runQueryInForeground(null, fQuery1);
AbstractTextSearchResult result= (AbstractTextSearchResult) fQuery1.getSearchResult();
int originalMatchCount= result.getMatchCount();
List<Match> allMatches= new ArrayList<>(originalMatchCount);
// first, collect all matches
Object[] elements= result.getElements();
for (Object element : elements) {
Match[] matches = result.getMatches(element);
for (Match matche : matches) {
allMatches.add(matche);
}
}
// now remove them and readd them in reverse order
result.removeAll();
assertTrue("removed all matches", result.getMatchCount() == 0);
for (int i= allMatches.size()-1; i >= 0; i--) {
result.addMatch(allMatches.get(i));
}
assertEquals("Test that all matches have been added again", result.getMatchCount(), originalMatchCount);
// now check that they're ordered by position.
for (Object element : elements) {
Match[] matches = result.getMatches(element);
assertTrue("has matches", matches.length > 0);
for (int j= 1; j < matches.length; j++) {
assertTrue("order problem", isLessOrEqual(matches[j-1], matches[j]));
}
}
}
private boolean isLessOrEqual(Match match, Match match2) {
int diff= match2.getOffset() - match.getOffset();
if (diff > 0)
return true;
else if (diff < 0)
return false;
else {
// equal offset, have to look at the length.
diff= match2.getLength() - match.getLength();
if (diff >= 0)
return true;
return false;
}
}
}
|
