Package com.tinkerpop.blueprints.pgm

Examples of com.tinkerpop.blueprints.pgm.Edge

402
403
404
405
406
407
408
409
410
411
412
   * Remove an edge "safely". That's to say with prior existence check.
   * @param database database from which edge should be removed
   * @param existing edge to remove
   */
  public static void removeSafely(Graph database, Edge existing) {
    Edge toRemove = null;
    if((toRemove = database.getEdge(existing.getId()))==null) {
      if (logger.isLoggable(Level.INFO)) {
        logger.log(Level.INFO, "We tried to remove non existing edge "+toString(existing));
      }
    } else {
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
  @Override
  public 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(IndexableGraphBackedFinderService.TYPE_EDGE_NAME).iterator().next();
      Vertex type = toType.getInVertex();
      // Do not use ClassLiteral here as this method must be blazing fast
      return IndexableGraphBackedFinderService.classTransformer.extractClassIn(service.getDriver().getValue(type).toString());
    }
  }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
        // 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 = getDriver().createEdgeFor(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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
    return vertex.getProperty(Properties.value.name());
  }

  public Edge createEdgeFor(Vertex fromVertex, Vertex toVertex, Property property) {
    String edgeNameFor = GraphUtils.getEdgeNameFor(property);
    Edge edge = database.addEdge(getEdgeId(fromVertex, toVertex, property), fromVertex, toVertex, edgeNameFor);
    String predicateProperty = GraphUtils.asSailProperty(GraphUtils.getEdgeNameFor(property));
    edge.setProperty(GraphSail.PREDICATE_PROP, predicateProperty);
    Collection<String> contexts = getLens();
    StringBuilder contextPropertyBuilder = new StringBuilder();
    if(contexts.size()==0) {
      contextPropertyBuilder.append(GraphUtils.asSailProperty(GraphSail.NULL_CONTEXT_NATIVE));
    } else {
      for(String context : contexts) {
        if(contextPropertyBuilder.length()>0)
          contextPropertyBuilder.append(" " );
        contextPropertyBuilder.append(GraphUtils.asSailProperty(context));
       
      }
    }
    String contextProperty = contextPropertyBuilder.toString();
    edge.setProperty(GraphSail.CONTEXT_PROP, contextProperty);
    // Finally build the context-predicate property by concatenating both
    edge.setProperty(GraphSail.CONTEXT_PROP + GraphSail.PREDICATE_PROP, contextProperty+" "+predicateProperty);
    return edge;
  }
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
      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
166
167
168
169
170
171
172
173
174
175
176
      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
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
    // as a consequenc,v alueVertex is loaded only for non null values
    Vertex valueVertex = null;
    if(value!=null) {
      valueVertex = service.getVertexFor(value, cascade, objectsBeingAccessed);
    }
    Edge link = null;
    // Get previously existing vertex
    Iterator<Edge> existingIterator = service.getStrategy().getOutEdgesFor(rootVertex, p).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(valueVertex!=null && 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
479
480
481
482
483
484
485
486
487
488
489
490
   */
  private <DataType> void loadSingle(GraphDatabaseDriver driver, GraphMappingStrategy strategy, ClassLoader classloader, ServiceRepository repository, Property p, DataType returned, Vertex objectVertex, Map<String, Object> objectsBeingAccessed) {
    Iterator<Edge> iterator = strategy.getOutEdgesFor(objectVertex, p).iterator();
    if(iterator.hasNext()) {
      // yeah, there is a value !
      Edge edge = iterator.next();
      Vertex firstVertex = edge.getInVertex();
      Object value = GraphUtils.createInstance(driver, strategy, classloader, firstVertex, p.getType(), repository, objectsBeingAccessed);
      if(repository.containsKey(value.getClass())) {
        // value requires fields loading
        AbstractBluePrintsBackedFinderService<IndexableGraph, DataType, ?> blueprints= (AbstractBluePrintsBackedFinderService<IndexableGraph, DataType, ?>) repository.get(value.getClass());
        value = loadObject(blueprints, firstVertex, objectsBeingAccessed);
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
165
            if(Kind.literal.equals(GraphUtils.getKindOf(vertex))) {
                // a literal with no type information should always been considered a string literal
            } else {
                Iterator<Edge> typeIterator = vertex.getOutEdges(IndexableGraphBackedFinderService.TYPE_EDGE_NAME).iterator();
                if(typeIterator.hasNext()) {
                    Edge toType = typeIterator.next();
                    Vertex type = toType.getInVertex();
                    // Do not use ClassLiteral here as this method must be blazing fast
                    return IndexableGraphBackedFinderService.classTransformer.extractClassIn(service.getDriver().getValue(type).toString());
                }
            }
    }
View Full Code Here
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
  private void updateSingle(Property p, DataType toUpdate, Vertex rootVertex) {
    Object value = p.get(toUpdate);
    // As a convention, null values are never stored
    if(value!=null) {
      Vertex valueVertex = getVertexFor(value);
      Edge link = null;
      // Get previously existing vertex
      Iterator<Edge> existingIterator = rootVertex.getOutEdges(GraphUtils.getEdgeNameFor(p)).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.