-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
AllNodeScan.java
72 lines (63 loc) · 1.86 KB
/
AllNodeScan.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
/*
* 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.store;
import org.neo4j.kernel.impl.store.NodeStore;
import org.neo4j.storageengine.api.BatchingLongProgression;
public class AllNodeScan implements BatchingLongProgression
{
private final NodeStore nodeStore;
private long start;
private boolean done;
AllNodeScan( NodeStore nodeStore )
{
this.nodeStore = nodeStore;
this.start = nodeStore.getNumberOfReservedLowIds();
}
@Override
public boolean nextBatch( Batch batch )
{
while ( true )
{
if ( done )
{
batch.nothing();
return false;
}
long highId = nodeStore.getHighestPossibleIdInUse();
if ( start <= highId )
{
batch.init( start, highId );
start = highId + 1;
return true;
}
done = true;
}
}
@Override
public boolean appendAdded()
{
return true;
}
@Override
public boolean fetchAdded()
{
return false;
}
}