-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
LabelScanStoreIT.java
237 lines (208 loc) · 7.28 KB
/
LabelScanStoreIT.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
/*
* 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.graphdb;
import org.junit.Rule;
import org.junit.Test;
import java.util.Set;
import org.neo4j.kernel.internal.GraphDatabaseAPI;
import org.neo4j.test.DatabaseRule;
import org.neo4j.test.EmbeddedDatabaseRule;
import static org.hamcrest.CoreMatchers.equalTo;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertThat;
import static org.neo4j.graphdb.Label.label;
import static org.neo4j.helpers.collection.IteratorUtil.asSet;
import static org.neo4j.helpers.collection.IteratorUtil.emptySetOf;
import static org.neo4j.helpers.collection.IteratorUtil.single;
public class LabelScanStoreIT
{
@Rule
public final DatabaseRule dbRule = new EmbeddedDatabaseRule();
@Test
public void shouldGetNodesWithCreatedLabel() throws Exception
{
// GIVEN
Node node1 = createLabeledNode( Labels.First );
Node node2 = createLabeledNode( Labels.Second );
Node node3 = createLabeledNode( Labels.Third );
Node node4 = createLabeledNode( Labels.First, Labels.Second, Labels.Third );
Node node5 = createLabeledNode( Labels.First, Labels.Third );
// THEN
assertEquals(
asSet( node1, node4, node5 ),
asSet( getAllNodesWithLabel( Labels.First ) ) );
assertEquals(
asSet( node2, node4 ),
asSet( getAllNodesWithLabel( Labels.Second ) ) );
assertEquals(
asSet( node3, node4, node5 ),
asSet( getAllNodesWithLabel( Labels.Third ) ) );
}
@Test
public void shouldGetNodesWithAddedLabel() throws Exception
{
// GIVEN
Node node1 = createLabeledNode( Labels.First );
Node node2 = createLabeledNode( Labels.Second );
Node node3 = createLabeledNode( Labels.Third );
Node node4 = createLabeledNode( Labels.First );
Node node5 = createLabeledNode( Labels.First );
// WHEN
addLabels( node4, Labels.Second, Labels.Third );
addLabels( node5, Labels.Third );
// THEN
assertEquals(
asSet( node1, node4, node5 ),
asSet( getAllNodesWithLabel( Labels.First ) ) );
assertEquals(
asSet( node2, node4 ),
asSet( getAllNodesWithLabel( Labels.Second ) ) );
assertEquals(
asSet( node3, node4, node5 ),
asSet( getAllNodesWithLabel( Labels.Third ) ) );
}
@Test
public void shouldGetNodesAfterDeletedNodes() throws Exception
{
// GIVEN
Node node1 = createLabeledNode( Labels.First, Labels.Second );
Node node2 = createLabeledNode( Labels.First, Labels.Third );
// WHEN
deleteNode( node1 );
// THEN
assertEquals(
asSet( node2 ),
getAllNodesWithLabel( Labels.First ) );
assertEquals(
emptySetOf( Node.class ),
getAllNodesWithLabel( Labels.Second ) );
assertEquals(
asSet( node2 ),
getAllNodesWithLabel( Labels.Third ) );
}
@Test
public void shouldGetNodesAfterRemovedLabels() throws Exception
{
// GIVEN
Node node1 = createLabeledNode( Labels.First, Labels.Second );
Node node2 = createLabeledNode( Labels.First, Labels.Third );
// WHEN
removeLabels( node1, Labels.First );
removeLabels( node2, Labels.Third );
// THEN
assertEquals(
asSet( node2 ),
getAllNodesWithLabel( Labels.First ) );
assertEquals(
asSet( node1 ),
getAllNodesWithLabel( Labels.Second ) );
assertEquals(
emptySetOf( Node.class ),
getAllNodesWithLabel( Labels.Third ) );
}
@Test
public void shouldHandleLargeAmountsOfNodesAddedAndRemovedInSameTx() throws Exception
{
// Given
GraphDatabaseAPI db = dbRule.getGraphDatabaseAPI();
int labelsToAdd = 80;
int labelsToRemove = 40;
// When
Node node;
try ( Transaction tx = db.beginTx() )
{
node = db.createNode();
// I create a lot of labels, enough to push the store to use two dynamic records
for ( int l = 0; l < labelsToAdd; l++ )
{
node.addLabel( label( "Label-" + l ) );
}
// and I delete some of them, enough to bring the number of dynamic records needed down to 1
for ( int l = 0; l < labelsToRemove; l++ )
{
node.removeLabel( label( "Label-" + l ) );
}
tx.success();
}
// Then
try ( Transaction ignore = db.beginTx() )
{
// All the labels remaining should be in the label scan store
for ( int l = labelsToAdd - 1; l >= labelsToRemove; l-- )
{
Label label = label( "Label-" + l );
assertThat( "Should have founnd node when looking for label " + label,
single( db.findNodes( label ) ), equalTo( node ) );
}
}
}
private void removeLabels( Node node, Label... labels )
{
try ( Transaction tx = dbRule.getGraphDatabaseService().beginTx() )
{
for ( Label label : labels )
{
node.removeLabel( label );
}
tx.success();
}
}
private void deleteNode( Node node )
{
try ( Transaction tx = dbRule.getGraphDatabaseService().beginTx() )
{
node.delete();
tx.success();
}
}
private Set<Node> getAllNodesWithLabel( Label label )
{
try ( Transaction tx = dbRule.getGraphDatabaseService().beginTx() )
{
return asSet( dbRule.getGraphDatabaseService().findNodes( label ) );
}
}
private Node createLabeledNode( Label... labels )
{
try ( Transaction tx = dbRule.getGraphDatabaseService().beginTx() )
{
Node node = dbRule.getGraphDatabaseService().createNode( labels );
tx.success();
return node;
}
}
private void addLabels( Node node, Label... labels )
{
try ( Transaction tx = dbRule.getGraphDatabaseService().beginTx() )
{
for ( Label label : labels )
{
node.addLabel( label );
}
tx.success();
}
}
private enum Labels implements Label
{
First,
Second,
Third
}
}