-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
LuceneIndexAccessorTest.java
366 lines (306 loc) · 13.9 KB
/
LuceneIndexAccessorTest.java
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
/*
* Copyright (c) 2002-2016 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.kernel.api.impl.index;
import org.junit.After;
import org.junit.Before;
import org.junit.Rule;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Parameterized;
import java.io.File;
import java.io.IOException;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.concurrent.Future;
import org.neo4j.collection.primitive.PrimitiveLongCollections;
import org.neo4j.collection.primitive.PrimitiveLongIterator;
import org.neo4j.function.IOFunction;
import org.neo4j.graphdb.mockfs.EphemeralFileSystemAbstraction;
import org.neo4j.helpers.TaskCoordinator;
import org.neo4j.kernel.api.exceptions.index.IndexEntryConflictException;
import org.neo4j.kernel.api.exceptions.index.IndexNotFoundKernelException;
import org.neo4j.kernel.api.impl.index.storage.DirectoryFactory;
import org.neo4j.kernel.api.impl.index.storage.IndexStorage;
import org.neo4j.kernel.api.impl.index.storage.ShardedIndexStorage;
import org.neo4j.kernel.api.index.IndexUpdater;
import org.neo4j.kernel.api.index.NodePropertyUpdate;
import org.neo4j.kernel.impl.api.index.IndexUpdateMode;
import org.neo4j.register.Registers;
import org.neo4j.storageengine.api.schema.IndexReader;
import org.neo4j.test.ThreadingRule;
import static java.util.Arrays.asList;
import static java.util.concurrent.TimeUnit.SECONDS;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertThat;
import static org.junit.Assert.fail;
import static org.neo4j.helpers.collection.IteratorUtil.asSet;
import static org.neo4j.helpers.collection.IteratorUtil.asUniqueSet;
import static org.neo4j.helpers.collection.IteratorUtil.emptySetOf;
import static org.neo4j.kernel.api.impl.index.IndexWriterFactories.standard;
import static org.neo4j.test.ThreadingRule.waitingWhileIn;
@RunWith( Parameterized.class )
public class LuceneIndexAccessorTest
{
@Rule
public final ThreadingRule threading = new ThreadingRule();
@Parameterized.Parameter
public IOFunction<DirectoryFactory,LuceneIndexAccessor> accessorFactory;
private LuceneIndexAccessor accessor;
private final long nodeId = 1, nodeId2 = 2;
private final Object value = "value", value2 = 40;
private DirectoryFactory.InMemoryDirectoryFactory dirFactory;
@Parameterized.Parameters( name = "{0}" )
public static Collection<IOFunction<DirectoryFactory,LuceneIndexAccessor>[]> implementations()
{
final File dir = new File( "dir" );
final LuceneDocumentStructure documentLogic = new LuceneDocumentStructure();
return Arrays.asList(
arg( new IOFunction<DirectoryFactory,LuceneIndexAccessor>()
{
@Override
public LuceneIndexAccessor apply( DirectoryFactory dirFactory )
throws IOException
{
IndexStorage indexStorage = getIndexStorage( dirFactory, dir );
return new NonUniqueLuceneIndexAccessor( documentLogic, standard(), indexStorage, 100_000 );
}
@Override
public String toString()
{
return NonUniqueLuceneIndexAccessor.class.getName();
}
} ),
arg( new IOFunction<DirectoryFactory,LuceneIndexAccessor>()
{
@Override
public LuceneIndexAccessor apply( DirectoryFactory dirFactory )
throws IOException
{
IndexStorage indexStorage = getIndexStorage( dirFactory, dir );
return new UniqueLuceneIndexAccessor( documentLogic, standard(), indexStorage );
}
@Override
public String toString()
{
return UniqueLuceneIndexAccessor.class.getName();
}
} )
);
}
private static IndexStorage getIndexStorage( DirectoryFactory dirFactory, File dir ) throws IOException
{
IndexStorage indexStorage = new ShardedIndexStorage( dirFactory, new EphemeralFileSystemAbstraction(), dir, 1 );
indexStorage.prepareIndexStorage();
return indexStorage;
}
private static IOFunction<DirectoryFactory,LuceneIndexAccessor>[] arg(
IOFunction<DirectoryFactory,LuceneIndexAccessor> foo )
{
return new IOFunction[]{foo};
}
@Before
public void before() throws IOException
{
dirFactory = new DirectoryFactory.InMemoryDirectoryFactory();
accessor = accessorFactory.apply( dirFactory );
}
@After
public void after()
{
dirFactory.close();
}
@Test
public void indexReaderShouldSupportScan() throws Exception
{
// GIVEN
updateAndCommit( asList( add( nodeId, value ), add( nodeId2, value2 ) ) );
IndexReader reader = accessor.newReader();
// WHEN
PrimitiveLongIterator results = reader.scan();
// THEN
assertEquals( asSet( nodeId, nodeId2 ), asSet( results ) );
assertEquals( asSet( nodeId ), asUniqueSet( reader.seek( value ) ) );
reader.close();
}
@Test
public void indexStringRangeQuery() throws IOException, IndexEntryConflictException
{
updateAndCommit( asList( add( 1, "A" ), add( 2, "B" ), add( 3, "C" ), add( 4, "" ) ) );
IndexReader reader = accessor.newReader();
PrimitiveLongIterator rangeFromBInclusive = reader.rangeSeekByString( "B", true, null, false );
assertThat( PrimitiveLongCollections.asArray( rangeFromBInclusive ), LongArrayMatcher.of( 2, 3 ) );
PrimitiveLongIterator rangeFromANonInclusive = reader.rangeSeekByString( "A", false, null, false );
assertThat( PrimitiveLongCollections.asArray( rangeFromANonInclusive ), LongArrayMatcher.of( 2, 3 ) );
PrimitiveLongIterator emptyLowInclusive = reader.rangeSeekByString( "", true, null, false );
assertThat( PrimitiveLongCollections.asArray( emptyLowInclusive ), LongArrayMatcher.of( 1, 2, 3, 4 ) );
PrimitiveLongIterator emptyUpperNonInclusive = reader.rangeSeekByString( "B", true, "", false );
assertThat( PrimitiveLongCollections.asArray( emptyUpperNonInclusive ), LongArrayMatcher.emptyArrayMatcher() );
PrimitiveLongIterator emptyInterval = reader.rangeSeekByString( "", true, "", true );
assertThat( PrimitiveLongCollections.asArray( emptyInterval ), LongArrayMatcher.of( 4 ) );
PrimitiveLongIterator emptyAllNonInclusive = reader.rangeSeekByString( "", false, null, false );
assertThat( PrimitiveLongCollections.asArray( emptyAllNonInclusive ), LongArrayMatcher.of( 1, 2, 3 ) );
PrimitiveLongIterator nullNonInclusive = reader.rangeSeekByString( null, false, null, false );
assertThat( PrimitiveLongCollections.asArray( nullNonInclusive ), LongArrayMatcher.of( 1, 2, 3, 4 ) );
PrimitiveLongIterator nullInclusive = reader.rangeSeekByString( null, false, null, false );
assertThat( PrimitiveLongCollections.asArray( nullInclusive ), LongArrayMatcher.of( 1, 2, 3, 4 ) );
}
@Test
public void indexNumberRangeQuery() throws IOException, IndexEntryConflictException
{
updateAndCommit( asList( add( 1, 1 ), add( 2, 2 ), add( 3, 3 ), add( 4, 4 ), add( 5, Double.NaN ) ) );
IndexReader reader = accessor.newReader();
PrimitiveLongIterator rangeTwoThree = reader.rangeSeekByNumberInclusive( 2, 3 );
assertThat( PrimitiveLongCollections.asArray( rangeTwoThree ), LongArrayMatcher.of( 2, 3 ) );
PrimitiveLongIterator infiniteMaxRange = reader.rangeSeekByNumberInclusive( 2, Long.MAX_VALUE );
assertThat( PrimitiveLongCollections.asArray( infiniteMaxRange ), LongArrayMatcher.of( 2, 3, 4 ) );
PrimitiveLongIterator infiniteMinRange = reader.rangeSeekByNumberInclusive( Long.MIN_VALUE, 3 );
assertThat( PrimitiveLongCollections.asArray( infiniteMinRange ), LongArrayMatcher.of( 1, 2, 3 ) );
PrimitiveLongIterator maxNanInterval = reader.rangeSeekByNumberInclusive( 3, Double.NaN );
assertThat( PrimitiveLongCollections.asArray( maxNanInterval ), LongArrayMatcher.of( 3, 4, 5 ) );
PrimitiveLongIterator minNanInterval = reader.rangeSeekByNumberInclusive( Double.NaN, 5 );
assertThat( PrimitiveLongCollections.asArray( minNanInterval ), LongArrayMatcher.emptyArrayMatcher() );
PrimitiveLongIterator nanInterval = reader.rangeSeekByNumberInclusive( Double.NaN, Double.NaN );
assertThat( PrimitiveLongCollections.asArray( nanInterval ), LongArrayMatcher.of( 5 ) );
}
@Test
public void indexReaderShouldHonorRepeatableReads() throws Exception
{
// GIVEN
updateAndCommit( asList( add( nodeId, value ) ) );
IndexReader reader = accessor.newReader();
// WHEN
updateAndCommit( asList( remove( nodeId, value ) ) );
// THEN
assertEquals( asSet( nodeId ), asUniqueSet( reader.seek( value ) ) );
reader.close();
}
@Test
public void multipleIndexReadersFromDifferentPointsInTimeCanSeeDifferentResults() throws Exception
{
// WHEN
updateAndCommit( asList( add( nodeId, value ) ) );
IndexReader firstReader = accessor.newReader();
updateAndCommit( asList( add( nodeId2, value2 ) ) );
IndexReader secondReader = accessor.newReader();
// THEN
assertEquals( asSet( nodeId ), asUniqueSet( firstReader.seek( value ) ) );
assertEquals( asSet( ), asUniqueSet( firstReader.seek( value2 ) ) );
assertEquals( asSet( nodeId ), asUniqueSet( secondReader.seek( value ) ) );
assertEquals( asSet( nodeId2 ), asUniqueSet( secondReader.seek( value2 ) ) );
firstReader.close();
secondReader.close();
}
@Test
public void canAddNewData() throws Exception
{
// WHEN
updateAndCommit( asList(
add( nodeId, value ),
add( nodeId2, value2 ) ) );
IndexReader reader = accessor.newReader();
// THEN
assertEquals( asSet( nodeId ), asUniqueSet( reader.seek( value ) ) );
reader.close();
}
@Test
public void canChangeExistingData() throws Exception
{
// GIVEN
updateAndCommit( asList( add( nodeId, value ) ) );
// WHEN
updateAndCommit( asList( change( nodeId, value, value2 ) ) );
IndexReader reader = accessor.newReader();
// THEN
assertEquals( asSet( nodeId ), asUniqueSet( reader.seek( value2 ) ) );
assertEquals( emptySetOf( Long.class ), asUniqueSet( reader.seek( value ) ) );
reader.close();
}
@Test
public void canRemoveExistingData() throws Exception
{
// GIVEN
updateAndCommit( asList(
add( nodeId, value ),
add( nodeId2, value2 ) ) );
// WHEN
updateAndCommit( asList( remove( nodeId, value ) ) );
IndexReader reader = accessor.newReader();
// THEN
assertEquals( asSet( nodeId2 ), asUniqueSet( reader.seek( value2 ) ) );
assertEquals( asSet( ), asUniqueSet( reader.seek( value ) ) );
reader.close();
}
@Test
public void shouldStopSamplingWhenIndexIsDropped() throws Exception
{
// given
updateAndCommit( asList(
add( nodeId, value ),
add( nodeId2, value2 ) ) );
// when
IndexReader indexReader = accessor.newReader(); // needs to be acquired before drop() is called
Future<Void> drop = threading.executeAndAwait( new IOFunction<Void, Void>()
{
@Override
public Void apply( Void nothing ) throws IOException
{
accessor.drop();
return nothing;
}
}, null, waitingWhileIn( TaskCoordinator.class, "awaitCompletion" ), 3, SECONDS );
try ( IndexReader reader = indexReader /* do not inline! */ )
{
reader.sampleIndex( Registers.newDoubleLongRegister() );
fail( "expected exception" );
}
catch ( IndexNotFoundKernelException e )
{
assertEquals( "Index dropped while sampling.", e.getMessage() );
}
finally
{
drop.get();
}
}
private NodePropertyUpdate add( long nodeId, Object value )
{
return NodePropertyUpdate.add( nodeId, 0, value, new long[0] );
}
private NodePropertyUpdate remove( long nodeId, Object value )
{
return NodePropertyUpdate.remove( nodeId, 0, value, new long[0] );
}
private NodePropertyUpdate change( long nodeId, Object valueBefore, Object valueAfter )
{
return NodePropertyUpdate.change( nodeId, 0, valueBefore, new long[0], valueAfter, new long[0] );
}
private void updateAndCommit( List<NodePropertyUpdate> nodePropertyUpdates )
throws IOException, IndexEntryConflictException
{
try ( IndexUpdater updater = accessor.newUpdater( IndexUpdateMode.ONLINE ) )
{
for ( NodePropertyUpdate update : nodePropertyUpdates )
{
updater.process( update );
}
}
}
}