Package com.tinkerpop.blueprints

Examples of com.tinkerpop.blueprints.Edge

289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
    }

    public void testFireEdgePropertyRemoved() {
        graph.addListener(graphChangedListener);

        Edge edge = createEdge();

        edge.setProperty("weight", System.currentTimeMillis());

        edge.removeProperty("weight");

        assertEquals(0, graphChangedListener.edgePropertyRemovedEventRecorded());
        ((EventTransactionalGraph) graph).commit();
        assertEquals(1, graphChangedListener.edgePropertyRemovedEventRecorded());
    }
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
                Assert.assertEquals(v.getProperty(key), found.getProperty(key));
            }
        }

        for (Edge e : graph.getEdges()) {
            Edge found = emptyGraph.getEdge(e.getId());

            Assert.assertNotNull(e);

            for (String key : found.getPropertyKeys()) {
                Assert.assertEquals(e.getProperty(key), found.getProperty(key));
            }
        }

    }
View Full Code Here
303
304
305
306
307
308
309
310
311
312
313
    }

    public void testFireEdgeRemoved() {
        graph.addListener(graphChangedListener);

        Edge edge = createEdge();

        graph.removeEdge(edge);

        assertEquals(0, graphChangedListener.edgeRemovedEventRecorded());
        ((EventTransactionalGraph) graph).commit();
View Full Code Here
316
317
318
319
320
321
322
323
324
325
326
327
328
    public void testTransactionSeriesWithSuccess() {
        graph.addListener(graphChangedListener);

        createEdge();
        Edge e = createEdge();
        e.setProperty("test", "it");
        e.setProperty("test", "that");

        Vertex v = createVertex();
        v.setProperty("test", "it");

        assertEquals(0, graphChangedListener.addEdgeEventRecorded());
View Full Code Here
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
            // no properties should be here
            Assert.assertEquals(null, found.getProperty("name"));
        }

        for (Edge e : graph.getEdges()) {
            Edge found = emptyGraph.getEdge(e.getId());

            Assert.assertNotNull(e);

            for (String key : found.getPropertyKeys()) {
                Assert.assertEquals(e.getProperty(key), found.getProperty(key));
            }

            // no properties should be here
            Assert.assertEquals(null, found.getProperty("weight"));
        }

    }
View Full Code Here
340
341
342
343
344
345
346
347
348
349
350
351
352
    public void testTransactionSeriesWithFailure() {
        graph.addListener(graphChangedListener);

        createEdge();
        Edge e = createEdge();
        e.setProperty("test", "it");
        e.setProperty("test", "that");

        Vertex v = createVertex();
        v.setProperty("test", "it");

        assertEquals(0, graphChangedListener.addEdgeEventRecorded());
View Full Code Here
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
        v1.removeProperty("aaa");

        Vertex v2 = graph.addVertex(20);
        Vertex v3 = graph.addVertex(30);

        Edge e1 = graph.addEdge(100, v1, v2, "friend");
        e1.setProperty("eee", "fff");
        e1.setProperty("ggg", "hhh");
        e1.setProperty("ggg", "hhhh");
        e1.removeProperty("eee");

        Edge e2 = graph.addEdge(101, v1, v2, "enemy");

        graph.removeEdge(e2);
        graph.removeVertex(v3);

        assertEquals(0, graphChangedListener.getOrder().size());
View Full Code Here
241
242
243
244
245
246
247
248
249
250
251
            if (null == v) {
                if (!firstClassEdges) {
                    return new StatementIteration();
                }

                Edge e = edgeForURI((URI) subject);
                if (null == e) {
                    return new StatementIteration();
                } else {
                    Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), allEdgeStatements);
                    return new StatementIteration(s);
View Full Code Here
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
                if (null == v) {
                    if (!firstClassEdges) {
                        return new StatementIteration();
                    }

                    Edge e = edgeForURI((URI) subject);
                    if (null == e) {
                        return new StatementIteration();
                    } else {
                        Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), edgeTypes);
                        return new StatementIteration(s);
                    }
                } else {
                    Source<Vertex> s = new Source<Vertex>(new SingleItemIterator<Vertex>(v), vertexTypes);
                    return new StatementIteration(s);
                }
            } else if (predicate.equals(PropertyGraphSail.ID)) {
                Vertex v = vertexForURI((URI) subject);
                if (null == v) {
                    if (!firstClassEdges) {
                        return new StatementIteration();
                    }

                    Edge e = edgeForURI((URI) subject);
                    if (null == e) {
                        return new StatementIteration();
                    } else {
                        Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), edgeIds);
                        return new StatementIteration(s);
                    }
                } else {
                    Source<Vertex> s = new Source<Vertex>(new SingleItemIterator<Vertex>(v), vertexIds);
                    return new StatementIteration(s);
                }
            } else if (predicate.equals(PropertyGraphSail.LABEL)) {
                if (!firstClassEdges) {
                    return new StatementIteration();
                }

                Edge e = edgeForURI((URI) subject);
                if (null == e) {
                    return new StatementIteration();
                } else {
                    Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), labels);
                    return new StatementIteration(s);
                }
            } else if (predicate.equals(PropertyGraphSail.HEAD)) {
                if (!firstClassEdges) {
                    return new StatementIteration();
                }

                Edge e = edgeForURI((URI) subject);
                if (null == e) {
                    return new StatementIteration();
                } else {
                    Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), heads);
                    return new StatementIteration(s);
                }
            } else if (predicate.equals(PropertyGraphSail.TAIL)) {
                if (!firstClassEdges) {
                    return new StatementIteration();
                }

                Edge e = edgeForURI((URI) subject);
                if (null == e) {
                    return new StatementIteration();
                } else {
                    Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), tails);
                    return new StatementIteration(s);
                }
            } else if (isPropertyPredicate(predicate)) {
                String key = keyFromPredicate(predicate);
                Vertex v = vertexForURI((URI) subject);
                if (null == v) {
                    if (!firstClassEdges) {
                        return new StatementIteration();
                    }

                    Edge e = edgeForURI((URI) subject);
                    if (null == e) {
                        return new StatementIteration();
                    } else {
                        Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), edgePropertiesWithKey(key, predicate));
                        return new StatementIteration(s);
View Full Code Here
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
                                                                           final Value object) throws SailException {
        if (subject instanceof URI) {
            Collection<Source> sources = new LinkedList<Source>();

            Vertex v = vertexForURI((URI) subject);
            Edge e = edgeForURI((URI) subject);
            Object val = literalToObject(object);
            Vertex vObj = object instanceof URI ? vertexForURI((URI) object) : null;

            // vertex id
            if (null != val && null != v) {
                if (v.getId().equals(val)) {
                    Source<Vertex> s = new Source<Vertex>(new SingleItemIterator<Vertex>(v), vertexIds);
                    sources.add(s);
                }
            }

            // vertex type
            if (null != v && object instanceof URI && ((URI) object).equals(PropertyGraphSail.VERTEX)) {
                Source<Vertex> s = new Source<Vertex>(new SingleItemIterator<Vertex>(v), vertexTypes);
                sources.add(s);
            }

            // vertex properties
            if (null != val && null != v) {
                Source<Vertex> vertices = new Source<Vertex>(
                        new SingleItemIterator<Vertex>(v),
                        vertexPropertiesWithValue(val, (Literal) object));
                sources.add(vertices);
            }

            if (firstClassEdges) {
                // edge id
                if (null != val && null != e) {
                    if (e.getId().equals(val)) {
                        Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), edgeIds);
                        sources.add(s);
                    }
                }

                // label
                if (null != val && (val instanceof String)) {
                    if (null != e && e.getLabel().equals(val)) {
                        Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), labels);
                        sources.add(s);
                    }
                }

                // head
                if (null != e && null != vObj && e.getVertex(Direction.IN).equals(vObj)) {
                    Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), heads);
                    sources.add(s);
                }

                // tail
                if (null != e && null != vObj && e.getVertex(Direction.OUT).equals(vObj)) {
                    Source<Edge> s = new Source<Edge>(new SingleItemIterator<Edge>(e), tails);
                    sources.add(s);
                }

                // edge type
View Full Code Here
TOP

Related Classes of com.tinkerpop.blueprints.Edge

  • com.dooapp.gaedo.blueprints.BluePrintsPersister
  • com.dooapp.gaedo.blueprints.GraphUtils
  • com.dooapp.gaedo.blueprints.indexable.IndexableGraphBackedFinderService
  • com.dooapp.gaedo.blueprints.operations.Deleter
  • com.dooapp.gaedo.blueprints.operations.Loader
  • com.dooapp.gaedo.blueprints.operations.Updater
  • com.dooapp.gaedo.blueprints.sail.SailGraphBackedFinderService
  • com.dooapp.gaedo.blueprints.strategies.BeanBasedMappingStrategy
  • com.orientechnologies.orient.test.database.auto.GraphDatabaseTest
  • com.thinkaurelius.titan.graphdb.TitanGraphTest
    • 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.