Lines 42-48
Link Here
|
42 |
package org.openidex.search; |
42 |
package org.openidex.search; |
43 |
|
43 |
|
44 |
import java.io.IOException; |
44 |
import java.io.IOException; |
|
|
45 |
import java.util.HashSet; |
45 |
import java.util.Iterator; |
46 |
import java.util.Iterator; |
|
|
47 |
import java.util.Set; |
46 |
import org.netbeans.junit.MockServices; |
48 |
import org.netbeans.junit.MockServices; |
47 |
import org.netbeans.junit.NbTestCase; |
49 |
import org.netbeans.junit.NbTestCase; |
48 |
import org.openide.filesystems.FileObject; |
50 |
import org.openide.filesystems.FileObject; |
Lines 80-88
Link Here
|
80 |
} |
82 |
} |
81 |
|
83 |
|
82 |
public void testEmptyList() { |
84 |
public void testEmptyList() { |
83 |
SearchInfo searchInfo = new CompoundSearchInfo(new SearchInfo[0]); |
85 |
SearchInfo.Files searchInfo = new CompoundSearchInfo(new SearchInfo[0]); |
84 |
assertFalse(searchInfo.canSearch()); |
86 |
assertFalse(searchInfo.canSearch()); |
85 |
assertFalse(searchInfo.objectsToSearch().hasNext()); |
87 |
assertFalse(searchInfo.objectsToSearch().hasNext()); |
|
|
88 |
assertFalse(searchInfo.filesToSearch().hasNext()); |
86 |
} |
89 |
} |
87 |
|
90 |
|
88 |
public void testOneItemList() throws IOException { |
91 |
public void testOneItemList() throws IOException { |
Lines 95-141
Link Here
|
95 |
dir.createData("c", DummyDataLoader.dummyExt); |
98 |
dir.createData("c", DummyDataLoader.dummyExt); |
96 |
DataFolder folder = DataFolder.findFolder(dir); |
99 |
DataFolder folder = DataFolder.findFolder(dir); |
97 |
|
100 |
|
98 |
|
|
|
99 |
SearchInfo refSearchInfo; |
101 |
SearchInfo refSearchInfo; |
100 |
SearchInfo testSearchInfo; |
102 |
SearchInfo testSearchInfo; |
101 |
boolean refCanSearch; |
|
|
102 |
boolean testCanSearch; |
103 |
Iterator refIt; |
103 |
Iterator refIt; |
104 |
Iterator testIt; |
104 |
Iterator testIt; |
105 |
int testIterationsCount; |
105 |
Set testSet = new HashSet(); |
106 |
|
|
|
107 |
|
106 |
|
108 |
refSearchInfo = new SimpleSearchInfo(folder, false, null); |
107 |
refSearchInfo = new SimpleSearchInfo(folder, false, null); |
109 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo}); |
108 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo}); |
110 |
assertTrue(testSearchInfo.canSearch()); |
109 |
assertTrue(testSearchInfo.canSearch()); |
111 |
|
110 |
|
|
|
111 |
for(testIt = testSearchInfo.objectsToSearch(); testIt.hasNext();){ |
112 |
testSet.add(testIt.next()); |
113 |
} |
112 |
refIt = refSearchInfo.objectsToSearch(); |
114 |
refIt = refSearchInfo.objectsToSearch(); |
113 |
testIt = testSearchInfo.objectsToSearch(); |
115 |
while (refIt.hasNext()) { |
114 |
for (testIterationsCount = 0;;testIterationsCount++) { |
116 |
assertTrue(testSet.remove(refIt.next())); |
115 |
boolean refHasNext = refIt.hasNext(); |
117 |
} |
116 |
boolean testHasNext = testIt.hasNext(); |
118 |
assertTrue(testSet.isEmpty()); |
117 |
assertEquals(refHasNext, testHasNext); |
|
|
118 |
|
119 |
|
119 |
if (!refHasNext) { |
|
|
120 |
break; |
121 |
} |
122 |
|
123 |
Object refObj = refIt.next(); |
124 |
Object testObj = testIt.next(); |
125 |
assertSame(refObj, testObj); |
126 |
} |
127 |
assertEquals(3, testIterationsCount); |
128 |
|
129 |
|
130 |
refSearchInfo = new SimpleSearchInfo(folder, false, null) { |
120 |
refSearchInfo = new SimpleSearchInfo(folder, false, null) { |
131 |
public boolean canSearch() { |
121 |
public boolean canSearch() { |
132 |
return false; |
122 |
return false; |
133 |
} |
123 |
} |
134 |
}; |
124 |
}; |
135 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo}); |
125 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo}); |
136 |
refCanSearch = refSearchInfo.canSearch(); |
126 |
assertEquals(refSearchInfo.canSearch(), testSearchInfo.canSearch()); |
137 |
testCanSearch = testSearchInfo.canSearch(); |
127 |
} |
138 |
assertEquals(refCanSearch, testCanSearch); |
128 |
|
|
|
129 |
public void testOneItemFilesList() throws IOException { |
130 |
FileSystem fs = FileUtil.createMemoryFileSystem(); |
131 |
FileObject fsRoot = fs.getRoot(); |
132 |
|
133 |
FileObject dir = fsRoot.createFolder("dir"); |
134 |
dir.createData("a", DummyDataLoader.dummyExt); |
135 |
dir.createData("b", DummyDataLoader.dummyExt); |
136 |
dir.createData("c", DummyDataLoader.dummyExt); |
137 |
DataFolder folder = DataFolder.findFolder(dir); |
138 |
|
139 |
SearchInfo.Files refSearchInfo; |
140 |
SearchInfo.Files testSearchInfo; |
141 |
Iterator refIt; |
142 |
Iterator testIt; |
143 |
Set testSet = new HashSet(); |
144 |
|
145 |
refSearchInfo = new SimpleSearchInfo(folder, false, null); |
146 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo}); |
147 |
assertTrue(testSearchInfo.canSearch()); |
148 |
|
149 |
for(testIt = testSearchInfo.filesToSearch(); testIt.hasNext();){ |
150 |
testSet.add(testIt.next()); |
151 |
} |
152 |
refIt = refSearchInfo.filesToSearch(); |
153 |
while (refIt.hasNext()) { |
154 |
assertTrue(testSet.remove(refIt.next())); |
155 |
} |
156 |
assertTrue(testSet.isEmpty()); |
157 |
|
158 |
refSearchInfo = new SimpleSearchInfo(folder, false, null) { |
159 |
public boolean canSearch() { |
160 |
return false; |
161 |
} |
162 |
}; |
163 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo}); |
164 |
assertEquals(refSearchInfo.canSearch(), testSearchInfo.canSearch()); |
139 |
} |
165 |
} |
140 |
|
166 |
|
141 |
public void testMultipleItemsList() throws IOException { |
167 |
public void testMultipleItemsList() throws IOException { |
Lines 158-191
Link Here
|
158 |
SearchInfo testSearchInfo; |
184 |
SearchInfo testSearchInfo; |
159 |
Iterator refIt; |
185 |
Iterator refIt; |
160 |
Iterator testIt; |
186 |
Iterator testIt; |
161 |
int testIterationsCount; |
|
|
162 |
|
163 |
|
187 |
|
164 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null); |
188 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null); |
165 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null); |
189 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null); |
166 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
190 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
167 |
refSearchInfo2}); |
191 |
refSearchInfo2}); |
168 |
assertTrue(testSearchInfo.canSearch()); |
192 |
assertTrue(testSearchInfo.canSearch()); |
169 |
|
193 |
|
170 |
testIterationsCount = 0; |
194 |
Set testSet = new HashSet(); |
171 |
testIt = testSearchInfo.objectsToSearch(); |
195 |
for(testIt = testSearchInfo.objectsToSearch(); testIt.hasNext();){ |
|
|
196 |
testSet.add(testIt.next()); |
197 |
} |
198 |
|
172 |
refIt = refSearchInfo1.objectsToSearch(); |
199 |
refIt = refSearchInfo1.objectsToSearch(); |
173 |
while (refIt.hasNext()) { |
200 |
while (refIt.hasNext()) { |
174 |
assertTrue(testIt.hasNext()); |
201 |
assertTrue(testSet.remove(refIt.next())); |
175 |
assertSame(refIt.next(), testIt.next()); |
|
|
176 |
testIterationsCount++; |
177 |
} |
202 |
} |
178 |
assertTrue(testIt.hasNext()); |
|
|
179 |
refIt = refSearchInfo2.objectsToSearch(); |
203 |
refIt = refSearchInfo2.objectsToSearch(); |
180 |
while (refIt.hasNext()) { |
204 |
while (refIt.hasNext()) { |
181 |
assertTrue(testIt.hasNext()); |
205 |
assertTrue(testSet.remove(refIt.next())); |
182 |
assertSame(refIt.next(), testIt.next()); |
|
|
183 |
testIterationsCount++; |
184 |
} |
206 |
} |
185 |
assertFalse(testIt.hasNext()); |
207 |
assertTrue(testSet.isEmpty()); |
186 |
assertEquals(5, testIterationsCount); |
208 |
|
187 |
|
209 |
|
188 |
|
|
|
189 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null); |
210 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null); |
190 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null) { |
211 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null) { |
191 |
public boolean canSearch() { |
212 |
public boolean canSearch() { |
Lines 195-212
Link Here
|
195 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
216 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
196 |
refSearchInfo2}); |
217 |
refSearchInfo2}); |
197 |
assertTrue(testSearchInfo.canSearch()); |
218 |
assertTrue(testSearchInfo.canSearch()); |
198 |
|
219 |
|
199 |
testIterationsCount = 0; |
220 |
testSet.clear(); |
200 |
testIt = testSearchInfo.objectsToSearch(); |
221 |
for(testIt = testSearchInfo.objectsToSearch(); testIt.hasNext();){ |
|
|
222 |
testSet.add(testIt.next()); |
223 |
} |
224 |
|
201 |
refIt = refSearchInfo1.objectsToSearch(); |
225 |
refIt = refSearchInfo1.objectsToSearch(); |
202 |
while (refIt.hasNext()) { |
226 |
while (refIt.hasNext()) { |
203 |
assertTrue(testIt.hasNext()); |
227 |
assertTrue(testSet.remove(refIt.next())); |
204 |
assertSame(refIt.next(), testIt.next()); |
|
|
205 |
testIterationsCount++; |
206 |
} |
228 |
} |
207 |
assertFalse(testIt.hasNext()); |
229 |
assertTrue(testSet.isEmpty()); |
208 |
assertEquals(3, testIterationsCount); |
230 |
|
209 |
|
|
|
210 |
|
231 |
|
211 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null) { |
232 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null) { |
212 |
public boolean canSearch() { |
233 |
public boolean canSearch() { |
Lines 218-233
Link Here
|
218 |
refSearchInfo2}); |
239 |
refSearchInfo2}); |
219 |
assertTrue(testSearchInfo.canSearch()); |
240 |
assertTrue(testSearchInfo.canSearch()); |
220 |
|
241 |
|
221 |
testIterationsCount = 0; |
242 |
testSet.clear(); |
222 |
testIt = testSearchInfo.objectsToSearch(); |
243 |
for(testIt = testSearchInfo.objectsToSearch(); testIt.hasNext();){ |
|
|
244 |
testSet.add(testIt.next()); |
245 |
} |
223 |
refIt = refSearchInfo2.objectsToSearch(); |
246 |
refIt = refSearchInfo2.objectsToSearch(); |
224 |
while (refIt.hasNext()) { |
247 |
while (refIt.hasNext()) { |
225 |
assertTrue(testIt.hasNext()); |
248 |
assertTrue(testSet.remove(refIt.next())); |
226 |
assertSame(refIt.next(), testIt.next()); |
|
|
227 |
testIterationsCount++; |
228 |
} |
249 |
} |
229 |
assertFalse(testIt.hasNext()); |
250 |
assertTrue(testSet.isEmpty()); |
230 |
assertEquals(2, testIterationsCount); |
|
|
231 |
|
251 |
|
232 |
|
252 |
|
233 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null) { |
253 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null) { |
Lines 244-248
Link Here
|
244 |
refSearchInfo2}); |
264 |
refSearchInfo2}); |
245 |
assertFalse(testSearchInfo.canSearch()); |
265 |
assertFalse(testSearchInfo.canSearch()); |
246 |
} |
266 |
} |
247 |
|
267 |
|
|
|
268 |
public void testMultipleItemsFilesList() throws IOException { |
269 |
FileSystem fs = FileUtil.createMemoryFileSystem(); |
270 |
FileObject fsRoot = fs.getRoot(); |
271 |
|
272 |
FileObject dir1 = fsRoot.createFolder("dir1"); |
273 |
dir1.createData("1a", DummyDataLoader.dummyExt); |
274 |
dir1.createData("1b", DummyDataLoader.dummyExt); |
275 |
dir1.createData("1c", DummyDataLoader.dummyExt); |
276 |
DataFolder folder1 = DataFolder.findFolder(dir1); |
277 |
|
278 |
FileObject dir2 = fsRoot.createFolder("dir2"); |
279 |
dir2.createData("2a", DummyDataLoader.dummyExt); |
280 |
dir2.createData("2b", DummyDataLoader.dummyExt); |
281 |
DataFolder folder2 = DataFolder.findFolder(dir2); |
282 |
|
283 |
|
284 |
SearchInfo.Files refSearchInfo1, refSearchInfo2; |
285 |
SearchInfo.Files testSearchInfo; |
286 |
Iterator refIt; |
287 |
Iterator testIt; |
288 |
|
289 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null); |
290 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null); |
291 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
292 |
refSearchInfo2}); |
293 |
assertTrue(testSearchInfo.canSearch()); |
294 |
|
295 |
Set testSet = new HashSet(); |
296 |
for(testIt = testSearchInfo.filesToSearch(); testIt.hasNext();){ |
297 |
testSet.add(testIt.next()); |
298 |
} |
299 |
|
300 |
refIt = refSearchInfo1.filesToSearch(); |
301 |
while (refIt.hasNext()) { |
302 |
assertTrue(testSet.remove(refIt.next())); |
303 |
} |
304 |
refIt = refSearchInfo2.filesToSearch(); |
305 |
while (refIt.hasNext()) { |
306 |
assertTrue(testSet.remove(refIt.next())); |
307 |
} |
308 |
assertTrue(testSet.isEmpty()); |
309 |
|
310 |
|
311 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null); |
312 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null) { |
313 |
public boolean canSearch() { |
314 |
return false; |
315 |
} |
316 |
}; |
317 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
318 |
refSearchInfo2}); |
319 |
assertTrue(testSearchInfo.canSearch()); |
320 |
|
321 |
testSet.clear(); |
322 |
for(testIt = testSearchInfo.filesToSearch(); testIt.hasNext();){ |
323 |
testSet.add(testIt.next()); |
324 |
} |
325 |
|
326 |
refIt = refSearchInfo1.filesToSearch(); |
327 |
while (refIt.hasNext()) { |
328 |
assertTrue(testSet.remove(refIt.next())); |
329 |
} |
330 |
assertTrue(testSet.isEmpty()); |
331 |
|
332 |
|
333 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null) { |
334 |
public boolean canSearch() { |
335 |
return false; |
336 |
} |
337 |
}; |
338 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null); |
339 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
340 |
refSearchInfo2}); |
341 |
assertTrue(testSearchInfo.canSearch()); |
342 |
|
343 |
testSet.clear(); |
344 |
for(testIt = testSearchInfo.filesToSearch(); testIt.hasNext();){ |
345 |
testSet.add(testIt.next()); |
346 |
} |
347 |
refIt = refSearchInfo2.filesToSearch(); |
348 |
while (refIt.hasNext()) { |
349 |
assertTrue(testSet.remove(refIt.next())); |
350 |
} |
351 |
assertTrue(testSet.isEmpty()); |
352 |
|
353 |
|
354 |
refSearchInfo1 = new SimpleSearchInfo(folder1, false, null) { |
355 |
public boolean canSearch() { |
356 |
return false; |
357 |
} |
358 |
}; |
359 |
refSearchInfo2 = new SimpleSearchInfo(folder2, false, null) { |
360 |
public boolean canSearch() { |
361 |
return false; |
362 |
} |
363 |
}; |
364 |
testSearchInfo = new CompoundSearchInfo(new SearchInfo[] {refSearchInfo1, |
365 |
refSearchInfo2}); |
366 |
assertFalse(testSearchInfo.canSearch()); |
367 |
} |
368 |
|
248 |
} |
369 |
} |