Package org.neo4j.graphalgo.core.huge
Class HugeGraphIntersect
- java.lang.Object
-
- org.neo4j.graphalgo.core.huge.GraphIntersect<TransientAdjacencyList.DecompressingCursor>
-
- org.neo4j.graphalgo.core.huge.HugeGraphIntersect
-
- All Implemented Interfaces:
RelationshipIntersect
public class HugeGraphIntersect extends GraphIntersect<TransientAdjacencyList.DecompressingCursor>
-
-
Field Summary
-
Fields inherited from class org.neo4j.graphalgo.core.huge.GraphIntersect
empty
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected long
advance(TransientAdjacencyList.DecompressingCursor cursor, long nodeId)
Get the node id greater than or equal (>=) to the providedtarget
.protected void
copyFrom(TransientAdjacencyList.DecompressingCursor sourceCursor, TransientAdjacencyList.DecompressingCursor targetCursor)
TransientAdjacencyList.DecompressingCursor
cursor(long node, TransientAdjacencyList.DecompressingCursor reuse)
protected int
degree(long node)
protected long
skipUntil(TransientAdjacencyList.DecompressingCursor cursor, long nodeId)
Get the node id strictly greater than (>) the providedtarget
.-
Methods inherited from class org.neo4j.graphalgo.core.huge.GraphIntersect
intersectAll
-
-
-
-
Method Detail
-
skipUntil
protected long skipUntil(TransientAdjacencyList.DecompressingCursor cursor, long nodeId)
Description copied from class:GraphIntersect
Get the node id strictly greater than (>) the providedtarget
. Might return an id that is less than or equal totarget
iff the cursor did exhaust before finding an id that is large enough.- Specified by:
skipUntil
in classGraphIntersect<TransientAdjacencyList.DecompressingCursor>
- Returns:
- the smallest node id in the cursor greater than the target.
-
advance
protected long advance(TransientAdjacencyList.DecompressingCursor cursor, long nodeId)
Description copied from class:GraphIntersect
Get the node id greater than or equal (>=) to the providedtarget
. Might return an id that is less thantarget
iff the cursor did exhaust before finding an id that is large enough. Will always take at least one step.- Specified by:
advance
in classGraphIntersect<TransientAdjacencyList.DecompressingCursor>
- Returns:
- the smallest node id in the cursor greater than or equal to the target.
-
copyFrom
protected void copyFrom(TransientAdjacencyList.DecompressingCursor sourceCursor, TransientAdjacencyList.DecompressingCursor targetCursor)
- Specified by:
copyFrom
in classGraphIntersect<TransientAdjacencyList.DecompressingCursor>
-
cursor
public TransientAdjacencyList.DecompressingCursor cursor(long node, TransientAdjacencyList.DecompressingCursor reuse)
- Specified by:
cursor
in classGraphIntersect<TransientAdjacencyList.DecompressingCursor>
-
degree
protected int degree(long node)
- Specified by:
degree
in classGraphIntersect<TransientAdjacencyList.DecompressingCursor>
-
-