1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*-
* ============LICENSE_START=======================================================
* org.openecomp.aai
* ================================================================================
* Copyright (C) 2017 AT&T Intellectual Property. All rights reserved.
* ================================================================================
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ============LICENSE_END=========================================================
*/
package org.openecomp.aai.query.builder;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
import org.apache.tinkerpop.gremlin.structure.Graph;
import org.apache.tinkerpop.gremlin.structure.T;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import org.apache.tinkerpop.gremlin.tinkergraph.structure.TinkerGraph;
import org.junit.Before;
import org.junit.Test;
import org.openecomp.aai.AAISetup;
import org.openecomp.aai.db.props.AAIProperties;
import org.openecomp.aai.exceptions.AAIException;
import org.openecomp.aai.introspection.Loader;
import org.openecomp.aai.introspection.LoaderFactory;
import org.openecomp.aai.introspection.ModelType;
import org.openecomp.aai.serialization.db.EdgeRules;
import org.openecomp.aai.serialization.db.EdgeType;
import java.util.ArrayList;
import java.util.List;
import static org.junit.Assert.assertTrue;
public class UntilTest extends AAISetup {
private Loader loader;
@Before
public void setup() throws Exception {
loader = LoaderFactory.createLoaderForVersion(ModelType.MOXY, AAIProperties.LATEST);
}
private QueryBuilder<Vertex> buildTestQuery(QueryBuilder<Vertex> qb) throws AAIException{
return qb.until(qb.newInstance().getVerticesByProperty("aai-node-type", "l-interface")).repeat(
qb.newInstance().union(
qb.newInstance().createEdgeTraversal(EdgeType.TREE, "cloud-region", "tenant"),
qb.newInstance().createEdgeTraversal(EdgeType.TREE, "tenant", "vserver"),
qb.newInstance().createEdgeTraversal(EdgeType.TREE, "vserver", "l-interface")
)).store("x").cap("x").unfold().dedup();
}
@Test
public void gremlinQueryUntilTest() throws AAIException {
Graph graph = TinkerGraph.open();
EdgeRules rules = EdgeRules.getInstance();
GraphTraversalSource g = graph.traversal();
Vertex v1 = graph.addVertex(T.id, 1, "aai-node-type", "cloud-region");
Vertex v2 = graph.addVertex(T.id, 2, "aai-node-type", "tenant");
Vertex v3 = graph.addVertex(T.id, 3, "aai-node-type", "vserver");
Vertex v4 = graph.addVertex(T.id, 4, "aai-node-type", "l-interface");
rules.addTreeEdge(g, v1, v2);
rules.addTreeEdge(g, v2, v3);
rules.addTreeEdge(g, v3, v4);
List<Vertex> expected = new ArrayList<>();
expected.add(v4);
GremlinTraversal<Vertex> qb = new GremlinTraversal<>(loader, g, v1);
QueryBuilder q = buildTestQuery(qb);
List<Vertex> results = q.toList();
assertTrue("results match", expected.containsAll(results) && results.containsAll(expected));
}
@Test
public void traversalQueryUntilTest() throws AAIException {
Graph graph = TinkerGraph.open();
EdgeRules rules = EdgeRules.getInstance();
GraphTraversalSource g = graph.traversal();
Vertex v1 = graph.addVertex(T.id, 1, "aai-node-type", "cloud-region");
Vertex v2 = graph.addVertex(T.id, 2, "aai-node-type", "tenant");
Vertex v3 = graph.addVertex(T.id, 3, "aai-node-type", "vserver");
Vertex v4 = graph.addVertex(T.id, 4, "aai-node-type", "l-interface");
rules.addTreeEdge(g, v1, v2);
rules.addTreeEdge(g, v2, v3);
rules.addTreeEdge(g, v3, v4);
List<Vertex> expected = new ArrayList<>();
expected.add(v4);
TraversalQuery<Vertex> qb = new TraversalQuery<>(loader, g, v1);
QueryBuilder<Vertex> q = buildTestQuery(qb);
List<Vertex> results = q.toList();
assertTrue("results match", expected.containsAll(results) && results.containsAll(expected));
}
}
|
