-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
NativeLabelScanStoreTest.java
175 lines (157 loc) · 5.81 KB
/
NativeLabelScanStoreTest.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
/*
* Copyright (c) 2002-2017 "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.impl.index.labelscan;
import org.junit.Before;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.RuleChain;
import java.io.IOException;
import java.util.BitSet;
import java.util.Random;
import org.neo4j.io.fs.DefaultFileSystemAbstraction;
import org.neo4j.io.pagecache.PageCache;
import org.neo4j.kernel.api.labelscan.LabelScanWriter;
import org.neo4j.kernel.api.labelscan.NodeLabelUpdate;
import org.neo4j.kernel.impl.api.scan.FullStoreChangeStream;
import org.neo4j.kernel.lifecycle.LifeRule;
import org.neo4j.storageengine.api.schema.LabelScanReader;
import org.neo4j.test.rule.PageCacheRule;
import org.neo4j.test.rule.RandomRule;
import org.neo4j.test.rule.TestDirectory;
import static org.junit.Assert.assertArrayEquals;
import static org.junit.rules.RuleChain.outerRule;
import static org.neo4j.collection.primitive.PrimitiveLongCollections.asArray;
import static org.neo4j.kernel.api.labelscan.NodeLabelUpdate.labelChanges;
public class NativeLabelScanStoreTest
{
private final TestDirectory directory = TestDirectory.testDirectory( getClass() );
private final PageCacheRule pageCacheRule = new PageCacheRule();
private final LifeRule life = new LifeRule( true );
private final RandomRule random = new RandomRule();
@Rule
public final RuleChain rules = outerRule( directory ).around( pageCacheRule ).around( life ).around( random );
private NativeLabelScanStore store;
private static final int NODE_COUNT = 10_000;
private static final int LABEL_COUNT = 12;
@Before
public void before()
{
PageCache pageCache = pageCacheRule.getPageCache( new DefaultFileSystemAbstraction() );
store = life.add( new NativeLabelScanStore( pageCache, directory.absolutePath(),
// a bit of random rangeSize
8 << random.nextInt( 4 ),
// a bit of random pageSize
Math.min( pageCache.pageSize(), 256 << random.nextInt( 5 ) ),
FullStoreChangeStream.EMPTY ) );
}
@Test
public void shouldRandomlyTestIt() throws Exception
{
// GIVEN
long[] expected = new long[NODE_COUNT];
randomModifications( expected, NODE_COUNT );
// WHEN/THEN
for ( int i = 0; i < 100; i++ )
{
verifyReads( expected );
randomModifications( expected, NODE_COUNT / 10 );
}
}
private void verifyReads( long[] expected )
{
try ( LabelScanReader reader = store.newReader() )
{
for ( int i = 0; i < LABEL_COUNT; i++ )
{
long[] actualNodes = asArray( reader.nodesWithLabel( i ) );
long[] expectedNodes = nodesWithLabel( expected, i );
assertArrayEquals( expectedNodes, actualNodes );
}
}
}
public static long[] nodesWithLabel( long[] expected, int labelId )
{
int mask = (1 << labelId);
int count = 0;
for ( long labels : expected )
{
if ( (labels & mask) != 0 )
{
count++;
}
}
long[] result = new long[count];
int cursor = 0;
for ( int nodeId = 0; nodeId < expected.length; nodeId++ )
{
long labels = expected[nodeId];
if ( (labels & mask) != 0 )
{
result[cursor++] = nodeId;
}
}
return result;
}
private void randomModifications( long[] expected, int count ) throws IOException
{
BitSet editedNodes = new BitSet();
try ( LabelScanWriter writer = store.newWriter() )
{
for ( int i = 0; i < count; i++ )
{
int nodeId = random.nextInt( NODE_COUNT );
if ( editedNodes.get( nodeId ) )
{
i--;
continue;
}
int changeSize = random.nextInt( 3 ) + 1;
long labels = expected[nodeId];
long[] labelsBefore = getLabels( labels );
for ( int j = 0; j < changeSize; j++ )
{
labels = flipRandom( labels, LABEL_COUNT, random.random() );
}
long[] labelsAfter = getLabels( labels );
editedNodes.set( nodeId );
NodeLabelUpdate labelChanges = labelChanges( nodeId, labelsBefore, labelsAfter );
writer.write( labelChanges );
expected[nodeId] = labels;
}
}
}
public static long flipRandom( long existingLabels, int highLabelId, Random random )
{
return existingLabels ^ (1 << random.nextInt( highLabelId ));
}
public static long[] getLabels( long bits )
{
long[] result = new long[Long.bitCount( bits )];
for ( int labelId = 0, c = 0; labelId < LABEL_COUNT; labelId++ )
{
int mask = 1 << labelId;
if ( (bits & mask) != 0 )
{
result[c++] = labelId;
}
}
return result;
}
}