Package com.tinkerpop.blueprints.impls.tg

Examples of com.tinkerpop.blueprints.impls.tg.TinkerGraph.addVertex()

34
35
36
37
38
39
40
41
42
43
44
  @Before
  public void before() {
    TinkerGraph graph = new TinkerGraph();
    beanGraph = new BeanGraph(graph);

    Vertex vertex = graph.addVertex(null);
    beanVertex = new BeanVertex() {
    };
    beanVertex.setElement(vertex);
    beanVertex.setBeanGraph(beanGraph);
  }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
  @Test
  public void should_wrap_existing_element() {
    TinkerGraph graph = new TinkerGraph();
    BeanGraph beanGraph = new BeanGraph(graph);
    Vertex vertex = graph.addVertex(null);
    vertex.setProperty("age", 42);

    Person person = beanGraph.wrap(vertex, Person.class);
    assertThat(person).isNotNull();
    assertThat(person.element()).isSameAs(vertex);
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
  public ExpectedException thrown = ExpectedException.none();

  @Test
  public void uniqueAdjacent() {
    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);
    Vertex b = graph.addVertex(null);
    Vertex c = graph.addVertex(null);
    graph.addEdge(null, a, b, "likes");
    graph.addEdge(null, a, c, "hates");
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
  @Test
  public void uniqueAdjacent() {
    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);
    Vertex b = graph.addVertex(null);
    Vertex c = graph.addVertex(null);
    graph.addEdge(null, a, b, "likes");
    graph.addEdge(null, a, c, "hates");

    assertThat(GraphUtil.singleAdjacent(a, Direction.OUT, "likes")).isEqualTo(b);
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
  @Test
  public void uniqueAdjacent() {
    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);
    Vertex b = graph.addVertex(null);
    Vertex c = graph.addVertex(null);
    graph.addEdge(null, a, b, "likes");
    graph.addEdge(null, a, c, "hates");

    assertThat(GraphUtil.singleAdjacent(a, Direction.OUT, "likes")).isEqualTo(b);
    assertThat(GraphUtil.singleAdjacent(a, Direction.OUT, "likes", "other")).isEqualTo(b);
View Full Code Here
841
842
843
844
845
846
847
848
849
850
851
  }

  @Test
  public void jsonFromElementNullsNoKeysNoTypes() {
    Graph g = new TinkerGraph();
    Vertex v = g.addVertex(1);
    v.setProperty("key", null);

    Map<String, Object> map = new HashMap<String, Object>();
    map.put("innerkey", null);
View Full Code Here
883
884
885
886
887
888
889
890
891
892
893
  }

  @Test
  public void jsonFromElementNullsNoKeysWithTypes() {
    Graph g = new TinkerGraph();
    Vertex v = g.addVertex(1);
    v.setProperty("key", null);

    Map<String, Object> map = new HashMap<String, Object>();
    map.put("innerkey", null);
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
  public void uniqueAdjacent_fail_if_multiple_adjacents() {
    thrown.expect(MultipleElementsException.class);
    thrown.expectMessage("More than one vertex is adjacent to: v[0], direction: OUT, labels: likes,hates");

    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);
    Vertex b = graph.addVertex(null);
    Vertex c = graph.addVertex(null);
    graph.addEdge(null, a, b, "likes");
    graph.addEdge(null, a, c, "likes");
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
    thrown.expect(MultipleElementsException.class);
    thrown.expectMessage("More than one vertex is adjacent to: v[0], direction: OUT, labels: likes,hates");

    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);
    Vertex b = graph.addVertex(null);
    Vertex c = graph.addVertex(null);
    graph.addEdge(null, a, b, "likes");
    graph.addEdge(null, a, c, "likes");

    GraphUtil.singleAdjacent(a, Direction.OUT, "likes", "hates");
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
    thrown.expectMessage("More than one vertex is adjacent to: v[0], direction: OUT, labels: likes,hates");

    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);
    Vertex b = graph.addVertex(null);
    Vertex c = graph.addVertex(null);
    graph.addEdge(null, a, b, "likes");
    graph.addEdge(null, a, c, "likes");

    GraphUtil.singleAdjacent(a, Direction.OUT, "likes", "hates");
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.