-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
CalculateDenseNodesStep.java
69 lines (64 loc) · 2.56 KB
/
CalculateDenseNodesStep.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
/*
* 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.unsafe.impl.batchimport;
import org.neo4j.kernel.impl.store.record.RelationshipRecord;
import org.neo4j.unsafe.impl.batchimport.cache.NodeRelationshipCache;
import org.neo4j.unsafe.impl.batchimport.staging.ForkedProcessorStep;
import org.neo4j.unsafe.impl.batchimport.staging.StageControl;
import org.neo4j.unsafe.impl.batchimport.stats.StatsProvider;
/**
* Increments counts for each visited relationship, once for start node and once for end node
* (unless for loops). This to be able to determine which nodes are dense before starting to import relationships.
*/
public class CalculateDenseNodesStep extends ForkedProcessorStep<RelationshipRecord[]>
{
private final NodeRelationshipCache cache;
public CalculateDenseNodesStep( StageControl control, Configuration config, NodeRelationshipCache cache,
StatsProvider... statsProviders )
{
super( control, "CALCULATE", config, statsProviders );
this.cache = cache;
}
@Override
protected void forkedProcess( int id, int processors, RelationshipRecord[] batch )
{
for ( RelationshipRecord record : batch )
{
if ( record.inUse() )
{
long startNodeId = record.getFirstNode();
long endNodeId = record.getSecondNode();
processNodeId( id, processors, startNodeId );
if ( startNodeId != endNodeId ) // avoid counting loops twice
{
// Loops only counts as one
processNodeId( id, processors, endNodeId );
}
}
}
}
private void processNodeId( int id, int processors, long nodeId )
{
if ( nodeId % processors == id )
{
cache.incrementCount( nodeId );
}
}
}