-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
RelationshipLinkbackProcessor.java
103 lines (97 loc) · 3.91 KB
/
RelationshipLinkbackProcessor.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
/*
* 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.unsafe.impl.batchimport;
import org.neo4j.graphdb.Direction;
import org.neo4j.kernel.impl.store.record.RelationshipRecord;
import org.neo4j.unsafe.impl.batchimport.cache.NodeRelationshipCache;
import static org.neo4j.unsafe.impl.batchimport.cache.idmapping.IdMapper.ID_NOT_FOUND;
/**
* Links the {@code previous} fields in {@link RelationshipRecord relationship records}. This is done after
* a forward pass where the {@code next} fields are linked.
*/
public class RelationshipLinkbackProcessor implements RecordProcessor<RelationshipRecord>
{
private final NodeRelationshipCache cache;
private final boolean denseNodes;
public RelationshipLinkbackProcessor( NodeRelationshipCache cache, boolean denseNodes )
{
this.cache = cache;
this.denseNodes = denseNodes;
}
@Override
public boolean process( RelationshipRecord record )
{
boolean isLoop = record.getFirstNode() == record.getSecondNode();
boolean firstIsDense = cache.isDense( record.getFirstNode() );
boolean changed = false;
if ( isLoop )
{
if ( firstIsDense == denseNodes )
{
long prevRel = cache.getAndPutRelationship( record.getFirstNode(),
Direction.BOTH, record.getId(), false );
if ( prevRel == ID_NOT_FOUND )
{ // First one
record.setFirstInFirstChain( true );
record.setFirstInSecondChain( true );
prevRel = cache.getCount( record.getFirstNode(), Direction.BOTH );
}
record.setFirstPrevRel( prevRel );
record.setSecondPrevRel( prevRel );
changed = true;
}
}
else
{
// Start node
if ( firstIsDense == denseNodes )
{
long firstPrevRel = cache.getAndPutRelationship( record.getFirstNode(),
Direction.OUTGOING, record.getId(), false );
if ( firstPrevRel == ID_NOT_FOUND )
{ // First one
record.setFirstInFirstChain( true );
firstPrevRel = cache.getCount( record.getFirstNode(), Direction.OUTGOING );
}
record.setFirstPrevRel( firstPrevRel );
changed = true;
}
// End node
boolean secondIsDense = cache.isDense( record.getSecondNode() );
if ( secondIsDense == denseNodes )
{
long secondPrevRel = cache.getAndPutRelationship( record.getSecondNode(),
Direction.INCOMING, record.getId(), false );
if ( secondPrevRel == ID_NOT_FOUND )
{ // First one
record.setFirstInSecondChain( true );
secondPrevRel = cache.getCount( record.getSecondNode(), Direction.INCOMING );
}
record.setSecondPrevRel( secondPrevRel );
changed = true;
}
}
return changed;
}
@Override
public void done()
{ // Nothing to do here
}
}