Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
647d38c
commit 19aa176
Showing
5 changed files
with
163 additions
and
72 deletions.
There are no files selected for viewing
56 changes: 56 additions & 0 deletions
56
community/kernel-api/src/test/java/org/neo4j/internal/kernel/api/Node.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,56 @@ | ||
package org.neo4j.internal.kernel.api; | ||
|
||
import java.util.Map; | ||
|
||
import org.neo4j.values.storable.Value; | ||
|
||
class Node | ||
{ | ||
final long id; | ||
private final long[] labels; | ||
final Map<Integer,Value> properties; | ||
|
||
Node( long id, long[] labels, Map<Integer,Value> properties ) | ||
{ | ||
this.id = id; | ||
this.labels = labels; | ||
this.properties = properties; | ||
} | ||
|
||
LabelSet labelSet() | ||
{ | ||
return new LabelSet() | ||
{ | ||
@Override | ||
public int numberOfLabels() | ||
{ | ||
return labels.length; | ||
} | ||
|
||
@Override | ||
public int label( int offset ) | ||
{ | ||
return labels.length; | ||
} | ||
|
||
@Override | ||
public boolean contains( int labelToken ) | ||
{ | ||
for ( long label : labels ) | ||
{ | ||
if ( label == labelToken ) | ||
{ | ||
return true; | ||
} | ||
} | ||
return false; | ||
} | ||
|
||
@Override | ||
public long[] all() | ||
{ | ||
return labels; | ||
} | ||
}; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
95 changes: 95 additions & 0 deletions
95
...nity/kernel-api/src/test/java/org/neo4j/internal/kernel/api/StubNodeLabelIndexCursor.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,95 @@ | ||
/* | ||
* 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; | ||
|
||
import java.util.Map; | ||
|
||
public class StubNodeLabelIndexCursor implements NodeLabelIndexCursor | ||
{ | ||
private int offset = -1; | ||
private final Map<Integer, long[]> lookup; | ||
private int label; | ||
|
||
public StubNodeLabelIndexCursor( Map<Integer,long[]> lookup ) | ||
{ | ||
this.lookup = lookup; | ||
} | ||
|
||
void initalize(int label) | ||
{ | ||
this.label = label; | ||
this.offset = -1; | ||
} | ||
|
||
|
||
@Override | ||
public void node( NodeCursor cursor ) | ||
{ | ||
|
||
} | ||
|
||
@Override | ||
public long nodeReference() | ||
{ | ||
long[] nodes = lookup.get( label ); | ||
if ( nodes == null ) | ||
{ | ||
return -1L; | ||
} | ||
|
||
return offset >= 0 && offset < nodes.length ? nodes[offset] : -1; | ||
} | ||
|
||
@Override | ||
public LabelSet labels() | ||
{ | ||
return null; | ||
} | ||
|
||
|
||
@Override | ||
public boolean next() | ||
{ | ||
long[] nodes = lookup.get( label ); | ||
if ( nodes == null ) | ||
{ | ||
return false; | ||
} | ||
return ++offset < nodes.length; | ||
} | ||
|
||
@Override | ||
public boolean shouldRetry() | ||
{ | ||
return false; | ||
} | ||
|
||
@Override | ||
public void close() | ||
{ | ||
|
||
} | ||
|
||
@Override | ||
public boolean isClosed() | ||
{ | ||
return false; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters