Package com.tinkerpop.blueprints.pgm

Examples of com.tinkerpop.blueprints.pgm.Edge

103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
        // some literals aren't so ... literal, as they can accept incoming connections (like classes)
        returned.setProperty(Properties.kind.name(), Tuples.get(valueClass).getKind().name());
      }
      // obtain vertex for type
      Vertex classVertex = classTransformer.getVertexFor(getDriver(), valueClass);
      Edge toType = GraphUtils.addEdgeFor(getDriver(), database, returned, classVertex, TypeProperty.INSTANCE);
      /*
       * Make sure literals are literals by changing that particular edge context to a null value.
       *  Notice we COULD have stored literal type as a property, instead of using
       */
      toType.setProperty(GraphSail.CONTEXT_PROP, GraphUtils.asSailProperty(GraphUtils.GAEDO_CONTEXT));
    }
    // Yup, this if has no default else statement, and that's normal.
   
    return returned;
  }
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
  @Override
  protected String getEffectiveType(Vertex vertex) {
    if(vertex.getProperty(Properties.type.name())!=null) {
      return TypeUtils.getClass(vertex.getProperty(Properties.type.name()).toString());
    } else {
      Edge toType = vertex.getOutEdges(TYPE_EDGE_NAME).iterator().next();
      Vertex type = toType.getInVertex();
      // Do not use ClassLiteral here as this method must be blazing fast
      return classTransformer.extractClassIn(getValue(type).toString());
    }
  }
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
      oldVertices.put(inVertex, e);
    }
    for(Object v : values.entrySet()) {
      Vertex valueVertex = service.getVertexFor(v, CascadeType.REFRESH, objectsBeingAccessed);
      if(oldVertices.containsKey(valueVertex)) {
        Edge oldEdge = oldVertices.remove(valueVertex);
        database.removeEdge(oldEdge);
        if(toCascade.contains(CascadeType.REMOVE)) {
          service.deleteOutEdgeVertex(objectVertex, valueVertex, v, objectsBeingAccessed);
        }
      }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
      oldVertices.put(inVertex, e);
    }
    for(Object v : values) {
      Vertex valueVertex = service.getVertexFor(v, CascadeType.REFRESH, objectsBeingAccessed);
      if(oldVertices.containsKey(valueVertex)) {
        Edge oldEdge = oldVertices.remove(valueVertex);
        database.removeEdge(oldEdge);
        if(toCascade.contains(CascadeType.REMOVE)) {
          service.deleteOutEdgeVertex(objectVertex, valueVertex, v, objectsBeingAccessed);
        }
      }
View Full Code Here
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
  public <DataType> void updateSingle(AbstractBluePrintsBackedFinderService<? extends Graph, DataType, ?> service, Graph database, Property p, Object toUpdate, Vertex rootVertex, CascadeType cascade, Map<String, Object> objectsBeingAccessed) {
    Object value = p.get(toUpdate);
    // As a convention, null values are never stored
    if(value!=null) {
      Vertex valueVertex = service.getVertexFor(value, cascade, objectsBeingAccessed);
      Edge link = null;
      // Get previously existing vertex
      String edgeNameFor = GraphUtils.getEdgeNameFor(p);
      Iterator<Edge> existingIterator = rootVertex.getOutEdges(edgeNameFor).iterator();
      // property is single-valued, so iteration can be done at most one
      if(existingIterator.hasNext()) {
        // There is an existing edge, change its target and maybe delete previous one
        Edge existing = existingIterator.next();
        if(existing.getInVertex().equals(valueVertex)) {
          // Nothing to do
          link = existing;
        } else {
          // delete old edge (TODO maybe delete vertex, if there is no other link (excepted obvious ones, like type, Object.classes, and id)
          database.removeEdge(existing);
View Full Code Here
495
496
497
498
499
500
501
502
503
504
505
506
   */
  private <DataType> void loadSingle(GraphDatabaseDriver driver, ClassLoader classloader, ServiceRepository repository, Property p, DataType returned, Vertex objectVertex, Map<String, Object> objectsBeingAccessed) {
    Iterator<Edge> iterator = objectVertex.getOutEdges(GraphUtils.getEdgeNameFor(p)).iterator();
    if(iterator.hasNext()) {
      // yeah, there is a value !
      Edge edge = iterator.next();
      Vertex firstVertex = edge.getInVertex();
      Object value = GraphUtils.createInstance(driver, classloader, firstVertex, p.getType(), repository, objectsBeingAccessed);
      if(repository.containsKey(value.getClass())) {
        // value requires fields loading
        IndexableGraphBackedFinderService blueprints= (IndexableGraphBackedFinderService) repository.get(value.getClass());
        p.set(returned, loadObject(blueprints, firstVertex, objectsBeingAccessed));
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
   * @param property
   * @return
   */
  public static Edge addEdgeFor(GraphDatabaseDriver driver, Graph database, Vertex fromVertex, Vertex toVertex, Property property) {
    String edgeNameFor = getEdgeNameFor(property);
    Edge edge = database.addEdge(fromVertex.getId().toString()+"_to_"+toVertex.getId().toString()+"___"+UUID.randomUUID().toString(),
            fromVertex, toVertex, edgeNameFor);
    edge.setProperty(GraphSail.PREDICATE_PROP, GraphSail.URI_PREFIX+" "+getDefaultEdgeNameFor(property));
    // Create a common context for all gaedo relationships
    edge.setProperty(GraphSail.CONTEXT_PROP, asSailProperty(GAEDO_CONTEXT));
    return edge;
  }
View Full Code Here
250
251
252
253
254
255
256
257
258
259
260
      oldVertices.put(inVertex, e);
    }
    for(Object v : values.entrySet()) {
      Vertex valueVertex = getVertexFor(v, CascadeType.REFRESH, objectsBeingAccessed);
      if(oldVertices.containsKey(valueVertex)) {
        Edge oldEdge = oldVertices.remove(valueVertex);
        database.removeEdge(oldEdge);
        if(toCascade.contains(CascadeType.REMOVE)) {
          deleteOutEdgeVertex(objectVertex, valueVertex, v, objectsBeingAccessed);
        }
      }
View Full Code Here
278
279
280
281
282
283
284
285
286
287
288
      oldVertices.put(inVertex, e);
    }
    for(Object v : values) {
      Vertex valueVertex = getVertexFor(v, CascadeType.REFRESH, objectsBeingAccessed);
      if(oldVertices.containsKey(valueVertex)) {
        Edge oldEdge = oldVertices.remove(valueVertex);
        database.removeEdge(oldEdge);
        if(toCascade.contains(CascadeType.REMOVE)) {
          deleteOutEdgeVertex(objectVertex, valueVertex, v, objectsBeingAccessed);
        }
      }
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
  private <DataType> void updateSingle(BluePrintsBackedFinderService<DataType, ?> service, IndexableGraph database, Property p, Object toUpdate, Vertex rootVertex, CascadeType cascade, Map<String, Object> objectsBeingAccessed) {
    Object value = p.get(toUpdate);
    // As a convention, null values are never stored
    if(value!=null) {
      Vertex valueVertex = service.getVertexFor(value, cascade, objectsBeingAccessed);
      Edge link = null;
      // Get previously existing vertex
      String edgeNameFor = GraphUtils.getEdgeNameFor(p);
      Iterator<Edge> existingIterator = rootVertex.getOutEdges(edgeNameFor).iterator();
      // property is single-valued, so iteration can be done at most one
      if(existingIterator.hasNext()) {
        // There is an existing edge, change its target and maybe delete previous one
        Edge existing = existingIterator.next();
        if(existing.getInVertex().equals(valueVertex)) {
          // Nothing to do
          link = existing;
        } else {
          // delete edge (TODO maybe delete vertex)
          database.removeEdge(existing);
View Full Code Here
TOP

Related Classes of com.tinkerpop.blueprints.pgm.Edge

  • com.dooapp.gaedo.blueprints.BluePrintsBackedFinderService
  • com.dooapp.gaedo.blueprints.BluePrintsPersister
  • com.dooapp.gaedo.blueprints.GraphUtils
  • com.dooapp.gaedo.blueprints.indexable.IndexableGraphBackedFinderService
  • com.dooapp.gaedo.blueprints.sail.SailGraphBackedFinderService
  • com.dooapp.gaedo.blueprints.strategies.BeanBasedMappingStrategy
    • 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.