-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
NodeStateImpl.java
260 lines (235 loc) · 7.72 KB
/
NodeStateImpl.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
/*
* 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.api.state;
import java.util.Collections;
import java.util.IdentityHashMap;
import java.util.Iterator;
import java.util.Set;
import org.neo4j.collection.primitive.Primitive;
import org.neo4j.collection.primitive.PrimitiveIntSet;
import org.neo4j.collection.primitive.PrimitiveLongCollections;
import org.neo4j.collection.primitive.PrimitiveLongIterator;
import org.neo4j.helpers.collection.Iterators;
import org.neo4j.kernel.api.exceptions.schema.ConstraintValidationException;
import org.neo4j.kernel.impl.api.state.RelationshipChangesForNode.DiffStrategy;
import org.neo4j.kernel.impl.util.diffsets.DiffSets;
import org.neo4j.storageengine.api.Direction;
import org.neo4j.storageengine.api.StorageProperty;
import org.neo4j.storageengine.api.txstate.NodeState;
import org.neo4j.storageengine.api.txstate.PropertyContainerState;
import org.neo4j.storageengine.api.txstate.ReadableDiffSets;
import static org.neo4j.collection.primitive.Primitive.intSet;
public class NodeStateImpl extends PropertyContainerStateImpl implements NodeState
{
private DiffSets<Integer> labelDiffSets;
private RelationshipChangesForNode relationshipsAdded;
private RelationshipChangesForNode relationshipsRemoved;
private Set<DiffSets<Long>> indexDiffs; // TODO: does this really fill any function?
private final TxState state;
NodeStateImpl( long id, TxState state )
{
super( id );
this.state = state;
}
@Override
public ReadableDiffSets<Integer> labelDiffSets()
{
return ReadableDiffSets.Empty.ifNull( labelDiffSets );
}
DiffSets<Integer> getOrCreateLabelDiffSets()
{
if ( null == labelDiffSets )
{
labelDiffSets = new DiffSets<>();
}
return labelDiffSets;
}
public void addRelationship( long relId, int typeId, Direction direction )
{
if ( !hasAddedRelationships() )
{
relationshipsAdded = new RelationshipChangesForNode( DiffStrategy.ADD, state );
}
relationshipsAdded.addRelationship( relId, typeId, direction );
}
public void removeRelationship( long relId, int typeId, Direction direction )
{
if ( hasAddedRelationships() )
{
if ( relationshipsAdded.removeRelationship( relId, typeId, direction ) )
{
// This was a rel that was added in this tx, no need to add it to the remove list, instead we just
// remove it from added relationships.
return;
}
}
if ( !hasRemovedRelationships() )
{
relationshipsRemoved = new RelationshipChangesForNode( DiffStrategy.REMOVE, state );
}
relationshipsRemoved.addRelationship( relId, typeId, direction );
}
@Override
public void clear()
{
super.clear();
if ( relationshipsAdded != null )
{
relationshipsAdded.clear();
}
if ( relationshipsRemoved != null )
{
relationshipsRemoved.clear();
}
if ( labelDiffSets != null )
{
labelDiffSets.clear();
}
if ( indexDiffs != null )
{
indexDiffs.clear();
}
}
@Override
public PrimitiveIntSet augmentLabels( PrimitiveIntSet labels )
{
ReadableDiffSets<Integer> labelDiffSets = labelDiffSets();
if ( !labelDiffSets.isEmpty() )
{
labelDiffSets.getRemoved().forEach( labels::remove );
labelDiffSets.getAdded().forEach( labels::add );
}
return labels;
}
@Override
public int augmentDegree( Direction direction, int degree )
{
if ( hasAddedRelationships() )
{
degree = relationshipsAdded.augmentDegree( direction, degree );
}
if ( hasRemovedRelationships() )
{
degree = relationshipsRemoved.augmentDegree( direction, degree );
}
return degree;
}
@Override
public int augmentDegree( Direction direction, int degree, int typeId )
{
if ( hasAddedRelationships() )
{
degree = relationshipsAdded.augmentDegree( direction, degree, typeId );
}
if ( hasRemovedRelationships() )
{
degree = relationshipsRemoved.augmentDegree( direction, degree, typeId );
}
return degree;
}
@Override
public void accept( NodeState.Visitor visitor ) throws ConstraintValidationException
{
super.accept( visitor );
if ( labelDiffSets != null )
{
visitor.visitLabelChanges( getId(), labelDiffSets.getAdded(), labelDiffSets.getRemoved() );
}
}
private boolean hasAddedRelationships()
{
return relationshipsAdded != null;
}
private boolean hasRemovedRelationships()
{
return relationshipsRemoved != null;
}
@Override
public PrimitiveIntSet relationshipTypes()
{
if ( hasAddedRelationships() )
{
return relationshipsAdded.relationshipTypes();
}
return intSet();
}
void addIndexDiff( DiffSets<Long> diff )
{
if ( indexDiffs == null )
{
indexDiffs = Collections.newSetFromMap( new IdentityHashMap<DiffSets<Long>, Boolean>() );
}
indexDiffs.add( diff );
}
void removeIndexDiff( DiffSets<Long> diff )
{
if ( indexDiffs != null )
{
indexDiffs.remove( diff );
}
}
void clearIndexDiffs( long nodeId )
{
if ( indexDiffs != null )
{
for ( DiffSets<Long> diff : indexDiffs )
{
if ( diff.getAdded().contains( nodeId ) )
{
diff.remove( nodeId );
}
else if ( diff.getRemoved().contains( nodeId ) )
{
diff.add( nodeId );
}
}
}
}
@Override
public boolean hasChanges()
{
return super.hasChanges() || hasAddedRelationships() || hasRemovedRelationships();
}
@Override
public PrimitiveLongIterator getAddedRelationships( Direction direction )
{
return relationshipsAdded != null ? relationshipsAdded.getRelationships( direction ) :
PrimitiveLongCollections.emptyIterator();
}
@Override
public PrimitiveLongIterator getAddedRelationships( Direction direction, int[] relTypes )
{
return relationshipsAdded != null ? relationshipsAdded.getRelationships( direction, relTypes ) :
PrimitiveLongCollections.emptyIterator();
}
public abstract static class Defaults extends StateDefaults<Long, NodeState, NodeStateImpl>
{
@Override
final NodeStateImpl createValue( Long id, TxState state )
{
return new NodeStateImpl( id, state );
}
@Override
final NodeState defaultValue()
{
return NodeState.EMPTY;
}
}
}