-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
StubNodeCursor.java
175 lines (150 loc) · 4.12 KB
/
StubNodeCursor.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-2019 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.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.internal.kernel.api.helpers;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import org.neo4j.internal.kernel.api.LabelSet;
import org.neo4j.internal.kernel.api.NodeCursor;
import org.neo4j.internal.kernel.api.PropertyCursor;
import org.neo4j.internal.kernel.api.RelationshipGroupCursor;
import org.neo4j.internal.kernel.api.RelationshipTraversalCursor;
import org.neo4j.values.storable.Value;
public class StubNodeCursor implements NodeCursor
{
private int offset = -1;
private boolean dense;
private List<NodeData> nodes = new ArrayList<>();
public StubNodeCursor()
{
this( true );
}
public StubNodeCursor( boolean dense )
{
this.dense = dense;
}
void single( long reference )
{
offset = Integer.MAX_VALUE;
for ( int i = 0; i < nodes.size(); i++ )
{
if ( reference == nodes.get( i ).id )
{
offset = i - 1;
}
}
}
void scan()
{
offset = -1;
}
public StubNodeCursor withNode( long id )
{
nodes.add( new NodeData( id, new long[]{}, Collections.emptyMap() ) );
return this;
}
public StubNodeCursor withNode( long id, long... labels )
{
nodes.add( new NodeData( id, labels, Collections.emptyMap() ) );
return this;
}
public StubNodeCursor withNode( long id, long[] labels, Map<Integer,Value> properties )
{
nodes.add( new NodeData( id, labels, properties ) );
return this;
}
@Override
public long nodeReference()
{
return offset >= 0 && offset < nodes.size() ? nodes.get( offset ).id : -1;
}
@Override
public LabelSet labels()
{
return offset >= 0 && offset < nodes.size() ? nodes.get( offset ).labelSet() : LabelSet.NONE;
}
@Override
public boolean hasLabel( int label )
{
return labels().contains( label );
}
@Override
public void relationships( RelationshipGroupCursor cursor )
{
((StubGroupCursor) cursor).rewind();
}
@Override
public void allRelationships( RelationshipTraversalCursor relationships )
{
((StubRelationshipCursor) relationships).rewind();
}
@Override
public void properties( PropertyCursor cursor )
{
((StubPropertyCursor) cursor).init( nodes.get( offset ).properties );
}
@Override
public long relationshipGroupReference()
{
throw new UnsupportedOperationException( "not implemented" );
}
@Override
public long allRelationshipsReference()
{
throw new UnsupportedOperationException( "not implemented" );
}
@Override
public long propertiesReference()
{
if ( offset >= 0 && offset < nodes.size() )
{
NodeData node = nodes.get( offset );
if ( !node.properties.isEmpty() )
{
return node.id;
}
}
return -1;
}
@Override
public boolean isDense()
{
return dense;
}
@Override
public boolean next()
{
if ( offset == Integer.MAX_VALUE )
{
return false;
}
return ++offset < nodes.size();
}
@Override
public void close()
{
}
@Override
public boolean isClosed()
{
return false;
}
}