Package org.neo4j.graphdb

Examples of org.neo4j.graphdb.Relationship

135
136
137
138
139
140
141
142
143
    @Path(UrlReverseLookerUpper.PATH_RELATIONSHIP_PROPERTY)
    @DeserializeWith(PropertyValueDeserializationStrategy.class)
    public void setRelationshipProperty(Invocation invocation, Output result)
            throws Exception
    {
        Relationship rel = invocation.getDB().getRelationshipById(getRelationshipId(invocation));
        rel.setProperty(getPropertyKey(invocation), invocation.getContent());
        result.okNoContent();
    }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
    // be sure geomNode is inside this RTree
    Node indexNode = findLeafContainingGeometryNode(geomNode, throwExceptionIfNotFound);
    if (indexNode == null) return;
   
    // remove the entry
        final Relationship geometryRtreeReference = geomNode.getSingleRelationship(RTreeRelationshipTypes.RTREE_REFERENCE, Direction.INCOMING);
        if (geometryRtreeReference != null) {
            geometryRtreeReference.delete();
        }
    if (deleteGeomNode) deleteNode(geomNode);

    // reorganize the tree if needed
    if (countChildren(indexNode, RTreeRelationshipTypes.RTREE_REFERENCE) == 0) {
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
  }
 
  // returns the old parent node
  private Node disconnectFromParent()
  {
    Relationship toParentNode = treeNode.getSingleRelationship(
      RelTypes.SUB_TREE, Direction.INCOMING );
    Node parentNode = toParentNode.getStartNode();
    toParentNode.delete();
    return parentNode;
  }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
    return treeNode.getBTree();
  }

  TreeNode getBeforeSubTree()
  {
    Relationship subTreeRel = getStartNode().getSingleRelationship(
      RelTypes.SUB_TREE, Direction.OUTGOING );
    if ( subTreeRel != null )
    {
      return new TreeNode( getBTree(),
        subTreeRel.getEndNode() );
    }
    return null;
  }
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
189
190
     
      // delete tree
      deleteRecursivelySubtree(indexRoot);
     
      // delete tree metadata
      Relationship metadataNodeRelationship = getRootNode().getSingleRelationship(RTreeRelationshipTypes.RTREE_METADATA, Direction.OUTGOING);
      Node metadataNode = metadataNodeRelationship.getEndNode();
      metadataNodeRelationship.delete();
      metadataNode.delete();
   
      tx.success();
    } finally {
      tx.finish();
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    return null;
  }

  TreeNode getAfterSubTree()
  {
    Relationship subTreeRel = getEndNode().getSingleRelationship(
      RelTypes.SUB_TREE, Direction.OUTGOING );
    if ( subTreeRel != null )
    {
      return new TreeNode( getBTree(),
        subTreeRel.getEndNode() );
    }
    return null;
  }
View Full Code Here
763
764
765
766
767
768
769
770
771
      return false;
    }
  }
 
  private Node getIndexNodeParent(Node indexNode) {
    Relationship relationship = indexNode.getSingleRelationship(RTreeRelationshipTypes.RTREE_CHILD, Direction.INCOMING);
    if (relationship == null) return null;
    else return relationship.getStartNode();
  } 
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
    return count;
  }
 
  KeyEntry getFirstEntry()
  {
    Relationship keyEntryRel = treeNode.getSingleRelationship(
      RelTypes.KEY_ENTRY, Direction.OUTGOING );
    assert treeNode.getSingleRelationship( RelTypes.KEY_ENTRY,
      Direction.INCOMING ) == null;
    if ( keyEntryRel != null )
    {
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
    return null;
  }

  NodeEntry getNextKey()
  {
    Relationship nextKeyRel = getEndNode().getSingleRelationship(
      RelTypes.KEY_ENTRY, Direction.OUTGOING );
    if ( nextKeyRel != null )
    {
      return new NodeEntry( getTreeNode(), nextKeyRel );
    }
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
    return null;
  }
 
  KeyEntry getLastEntry()
  {
    Relationship keyEntryRel = treeNode.getSingleRelationship(
      RelTypes.KEY_ENTRY, Direction.OUTGOING );
    KeyEntry last = null;
    while ( keyEntryRel != null )
    {
      last = new KeyEntry( this, keyEntryRel );
      keyEntryRel = keyEntryRel.getEndNode().getSingleRelationship(
        RelTypes.KEY_ENTRY, Direction.OUTGOING );
    }
    return last;
  }
View Full Code Here
TOP

Related Classes of org.neo4j.graphdb.Relationship

  • com.cedarsoft.serialization.neo4j.AbstractNeo4jSerializer
  • com.drighetto.neo4j.SocialNetworkSample
  • com.eugeneborshch.routecalculator.optimize.WayStartNodeFinder
  • com.graphaware.common.util.DirectionUtilsTest
  • de.alpengeist.NeoFeeder
  • de.metalcon.socialgraph.NeoUtils
  • er.neo4jadaptor.ersatz.neo4j.Neo4JNodeErsatz
  • examples.ImdbExampleTest
  • examples.PathFindingExamplesTest
  • ie.transportdublin.shortestpath.ShortestPath
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.