Refine search
static boolean matchDirection( Direction dir, Node start, Relationship rel ) { switch ( dir ) { case INCOMING: return rel.getEndNode().equals( start ); case OUTGOING: return rel.getStartNode().equals( start ); case BOTH: return true; default: throw new IllegalArgumentException( "Unknown direction: " + dir ); } }
private static String relToString( Relationship rel ) { return rel.getStartNode() + "--" + rel.getType() + "-->" + rel.getEndNode(); }
private void appendRelationship( PrintWriter out, Relationship rel ) { out.print( "create (" ); out.print( identifier( rel.getStartNode() ) ); out.print( ")-[:" ); out.print( quote( rel.getType().name() ) ); formatProperties( out, rel ); out.print( "]->(" ); out.print( identifier( rel.getEndNode() ) ); out.println( ")" ); }
private boolean isLoop( Relationship r ) { return r.getStartNode().equals( r.getEndNode() ); }
startNode = endNode; endNode = nodeIterator.next(); if ( rel.getStartNode().equals(startNode) && rel.getEndNode().equals(endNode) )
public void add( Relationship rel ) { final long id = rel.getId(); if ( !relationships.containsKey( id ) ) { addRel( id, rel ); add( rel.getStartNode() ); add( rel.getEndNode() ); } }
nodes.add( relationship.getStartNode() ); nodes.add( relationship.getEndNode() );
private static Relationship createRelationship( long startNodeId, long endNodeId ) { Relationship relationship = mock( Relationship.class ); Node startNode = createNode( startNodeId ); Node endNode = createNode( endNodeId ); when( relationship.getStartNode() ).thenReturn( startNode ); when( relationship.getEndNode() ).thenReturn( endNode ); return relationship; }
private static Relationship mockRelationship( long id, Node start, String type, Node end, Properties properties ) { Relationship relationship = mockPropertyContainer( Relationship.class, properties ); when( relationship.getId() ).thenReturn( id ); when( relationship.getStartNode() ).thenReturn( start ); when( relationship.getEndNode() ).thenReturn( end ); when( relationship.getType() ).thenReturn( RelationshipType.withName( type ) ); return relationship; }
RelationshipData( Relationship relationship ) { this.startNode = relationship.getStartNode(); this.type = relationship.getType().name(); this.endNode = relationship.getEndNode(); } }
private Runnable getNodesFromRelationship() { return () -> { relationship.getEndNode(); relationship.getStartNode(); relationship.getNodes(); relationship.getOtherNode( node ); }; }
Integer i1 = nodeIndexes.get( relationship.getStartNode() ); Integer i2 = nodeIndexes.get( relationship.getEndNode() ); if ( i1 == null || i2 == null )
@Override public String represent( Relationship item ) { return nodes.represent( item.getStartNode() ) + " " + rel.represent( item ) + " " + nodes.represent( item.getEndNode() ); } }
@Override public String represent( Relationship item ) { return nodes.represent( item.getStartNode() ) + " " + rel.represent( item ) + " " + nodes.represent( item.getEndNode() ); } }
out.writeStringField( "startNode", Long.toString( relationship.getStartNode().getId() ) ); out.writeStringField( "endNode", Long.toString( relationship.getEndNode().getId() ) ); writeProperties( out, relationship );
public static Link link( Relationship relationship, Node node ) { if ( relationship.getStartNode().getId() == node.getId() ) { return new Link( node, relationship ); } if ( relationship.getEndNode().getId() == node.getId() ) { return new Link( relationship, node ); } throw illegalArgument( "%s is neither the start node nor the end node of %s", node, relationship ); }
public Node checkNode( Node node ) { if ( isStartNode ) { if ( node.getId() != relationship.getEndNode().getId() ) { throw illegalArgument( "%s is not the end node of %s", node, relationship ); } } else { if ( node.getId() != relationship.getStartNode().getId() ) { throw illegalArgument( "%s is not the start node of %s", node, relationship ); } } return this.node; }
if ( rel.getStartNode().equals( node2 ) && rel.getEndNode().equals( node2 ) ) else if ( rel.getStartNode().equals( node2 ) ) if ( rel.getStartNode().equals( node2 ) && rel.getEndNode().equals( node2 ) ) else if ( rel.getStartNode().equals( node2 ) ) if ( rel.getStartNode().equals( node2 ) && rel.getEndNode().equals( node2 ) )
@Test public void shouldMapDirectRelationship() { // Given Node start, end; Relationship relationship; try ( Transaction tx = db.beginTx() ) { start = db.createNode(); end = db.createNode(); relationship = start.createRelationshipTo( end, RelationshipType.withName( "R" ) ); tx.success(); } RelationshipValue relationshipValue = VirtualValues.relationshipValue( relationship.getId(), nodeValue( start.getId(), Values.EMPTY_TEXT_ARRAY, EMPTY_MAP ), nodeValue( start.getId(), Values.EMPTY_TEXT_ARRAY, EMPTY_MAP ), stringValue( "R" ), EMPTY_MAP ); // When Relationship coreAPIRelationship = mapper.mapRelationship( relationshipValue ); // Then try ( Transaction ignore = db.beginTx() ) { assertThat( coreAPIRelationship.getId(), equalTo( relationship.getId() ) ); assertThat( coreAPIRelationship.getStartNode(), equalTo( start ) ); assertThat( coreAPIRelationship.getEndNode(), equalTo( end ) ); } }
public WeightedRelationshipResult(Relationship rel, double weight) { this.rel = rel; this.weight = weight; this.start = rel.getStartNode(); this.end = rel.getEndNode(); } }