-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
RelationshipGroupCursor.java
81 lines (68 loc) · 2.38 KB
/
RelationshipGroupCursor.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
/*
* 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.internal.kernel.api;
/**
* Cursor for traversing the relationship groups of a node.
*/
public interface RelationshipGroupCursor extends SuspendableCursor<RelationshipGroupCursor.Position>
{
abstract class Position extends CursorPosition<Position>
{
}
/**
* Find the first relationship group with a label greater than or equal to the provided label.
* <p>
* Note that the default implementation of this method (and most likely any sane use of this method - regardless of
* implementation) assumes that relationship groups are ordered by label.
*
* @param relationshipLabel the relationship label to search for.
* @return {@code true} if a matching relationship group was found, {@code false} if all relationship groups
* within
* reach
* of
* this
* cursor were exhausted without finding a matching relationship group.
*/
default boolean seek( int relationshipLabel )
{
while ( next() )
{
if ( relationshipLabel < relationshipLabel() )
{
return true;
}
}
return false;
}
int relationshipLabel();
int outgoingCount();
int incomingCount();
int loopCount();
default int totalCount()
{
return outgoingCount() + incomingCount() + loopCount();
}
void outgoing( RelationshipTraversalCursor cursor );
void incoming( RelationshipTraversalCursor cursor );
void loops( RelationshipTraversalCursor cursor );
long outgoingReference();
long incomingReference();
long loopsReference();
}