-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
LabelScanValueIndexProgressor.java
89 lines (81 loc) · 2.94 KB
/
LabelScanValueIndexProgressor.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
/*
* Copyright (c) 2002-2018 "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 java.io.IOException;
import java.io.UncheckedIOException;
import java.util.Collection;
import org.neo4j.cursor.RawCursor;
import org.neo4j.graphdb.Resource;
import org.neo4j.index.internal.gbptree.Hit;
import org.neo4j.storageengine.api.schema.IndexProgressor;
/**
* {@link IndexProgressor} which steps over multiple {@link LabelScanValue} and for each
* iterate over each set bit, returning actual node ids, i.e. {@code nodeIdRange+bitOffset}.
*
*/
class LabelScanValueIndexProgressor extends LabelScanValueIndexAccessor implements IndexProgressor, Resource
{
private final NodeLabelClient client;
LabelScanValueIndexProgressor( RawCursor<Hit<LabelScanKey,LabelScanValue>,IOException> cursor,
Collection<RawCursor<Hit<LabelScanKey,LabelScanValue>,IOException>> toRemoveFromWhenClosed,
NodeLabelClient client )
{
super( toRemoveFromWhenClosed, cursor );
this.client = client;
}
/**
* @return next node id in the current {@link LabelScanValue} or, if current value exhausted,
* goes to next {@link LabelScanValue} from {@link RawCursor}. Returns {@code true} if next node id
* was found, otherwise {@code false}.
*/
@Override
public boolean next()
{
while ( true )
{
if ( bits != 0 )
{
int delta = Long.numberOfTrailingZeros( bits );
bits &= bits - 1;
if ( client.acceptNode( baseNodeId + delta, null ) )
{
return true;
}
}
try
{
if ( !cursor.next() )
{
close();
return false;
}
}
catch ( IOException e )
{
throw new UncheckedIOException( e );
}
Hit<LabelScanKey,LabelScanValue> hit = cursor.get();
baseNodeId = hit.key().idRange * LabelScanValue.RANGE_SIZE;
bits = hit.value().bits;
//noinspection AssertWithSideEffects
assert keysInOrder( hit.key() );
}
}
}