2 * ============LICENSE_START=======================================================
4 * ================================================================================
5 * Copyright © 2017-2018 AT&T Intellectual Property. All rights reserved.
6 * ================================================================================
7 * Licensed under the Apache License, Version 2.0 (the "License");
8 * you may not use this file except in compliance with the License.
9 * You may obtain a copy of the License at
11 * http://www.apache.org/licenses/LICENSE-2.0
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS,
15 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
18 * ============LICENSE_END=========================================================
20 package org.onap.aai.query.builder;
22 import static org.junit.Assert.assertEquals;
23 import static org.junit.Assert.assertTrue;
25 import java.io.UnsupportedEncodingException;
27 import java.net.URISyntaxException;
28 import java.util.List;
30 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
31 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__;
32 import org.apache.tinkerpop.gremlin.structure.Edge;
33 import org.apache.tinkerpop.gremlin.structure.Vertex;
34 import org.junit.Test;
35 import org.onap.aai.db.props.AAIProperties;
36 import org.onap.aai.exceptions.AAIException;
37 import org.onap.aai.serialization.db.EdgeType;
39 public class TraversalQueryTest extends QueryBuilderTestAbstraction {
43 protected QueryBuilder<Edge> getNewEdgeTraversal(Vertex v) {
44 return new TraversalQuery<>(loader, g, v, testEdgeRules);
48 protected QueryBuilder<Edge> getNewEdgeTraversal() {
49 return new TraversalQuery<>(loader, g, testEdgeRules);
53 protected QueryBuilder<Vertex> getNewVertexTraversal(Vertex v) {
54 return new TraversalQuery<>(loader, g, v, testEdgeRules);
58 protected QueryBuilder<Vertex> getNewVertexTraversal() {
59 return new TraversalQuery<>(loader, g, testEdgeRules);
63 public void unionQuery() {
64 QueryBuilder<Vertex> tQ = new TraversalQuery<>(loader, g);
65 QueryBuilder<Vertex> tQ2 = new TraversalQuery<>(loader, g);
66 QueryBuilder<Vertex> tQ3 = new TraversalQuery<>(loader, g);
68 tQ2.getVerticesByProperty("test1", "value1"),
69 tQ3.getVerticesByIndexedProperty("test2", "value2"));
71 GraphTraversal<Vertex, Vertex> expected = __.<Vertex>start()
72 .union(__.has("test1", "value1"),__.has("test2", "value2"));
74 assertEquals("they are equal", expected, tQ.getQuery());
80 public void traversalClones() throws UnsupportedEncodingException, AAIException, URISyntaxException {
81 QueryBuilder<Vertex> tQ = new TraversalQuery<>(loader, g);
82 QueryBuilder<Vertex> builder = tQ.createQueryFromURI(new URI("network/generic-vnfs/generic-vnf/key1")).getQueryBuilder();
83 GraphTraversal<Vertex, Vertex> expected = __.<Vertex>start().has("vnf-id", "key1").has("aai-node-type", "generic-vnf");
84 GraphTraversal<Vertex, Vertex> containerExpected = __.<Vertex>start().has("aai-node-type", "generic-vnf");
86 assertEquals("query object", expected.toString(), builder.getQuery().toString());
87 assertEquals("container query object", containerExpected.toString(), builder.getContainerQuery().getQuery().toString());
93 public void nestedTraversalClones() throws UnsupportedEncodingException, AAIException, URISyntaxException {
95 QueryBuilder<Vertex> tQ = new TraversalQuery<>(loader, g);
96 QueryBuilder<Vertex> builder = tQ.createQueryFromURI(new URI("network/generic-vnfs/generic-vnf/key1/l-interfaces/l-interface/key2")).getQueryBuilder();
97 GraphTraversal<Vertex, Vertex> expected = __.<Vertex>start()
98 .has("vnf-id", "key1")
99 .has("aai-node-type", "generic-vnf")
100 .in("org.onap.relationships.inventory.BelongsTo").has(AAIProperties.NODE_TYPE, "l-interface")
101 .has("interface-name", "key2");
102 GraphTraversal<Vertex, Vertex> containerExpected = __.<Vertex>start()
103 .has("vnf-id", "key1")
104 .has("aai-node-type", "generic-vnf")
105 .in("org.onap.relationships.inventory.BelongsTo")
106 .has(AAIProperties.NODE_TYPE, "l-interface");
108 assertEquals("query object", expected.toString(), builder.getQuery().toString());
109 assertEquals("container query object", containerExpected.toString(), builder.getContainerQuery().getQuery().toString());
115 public void abstractEdgeToVertexTraversalTest() throws AAIException {
117 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
118 Vertex vnfc1 = g.addV("aai-node-type","vnfc","vnfc-name","a-name").next();
120 testEdgeRules.addEdge(g, gvnf, vnfc1);
122 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
123 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "vnfc");
125 List<Vertex> list = tQ.toList();
127 assertEquals("Has 1 vertexes ", 1, list.size());
128 assertTrue("Has vertex on the default edge ", list.contains(vnfc1));
134 public void abstractEdgeToVertexTraversalSingleOutRuleTest() throws AAIException {
136 Vertex vce = g.addV("aai-node-type","vce","vnf-id","vce").next();
137 Vertex vnfc1 = g.addV("aai-node-type","vnfc","vnfc-name","a-name").next();
139 testEdgeRules.addEdge(g, vce, vnfc1);
141 QueryBuilder<Vertex> tQ1 = new TraversalQuery<>(loader, g, vce, testEdgeRules);
142 tQ1.createEdgeTraversal(EdgeType.COUSIN, "vnf", "vnfc");
144 QueryBuilder<Vertex> tQ2 = new TraversalQuery<>(loader, g, vnfc1, testEdgeRules);
145 tQ2.createEdgeTraversal(EdgeType.COUSIN, "vnfc", "vnf");
147 List<Vertex> list1 = tQ1.toList();
148 List<Vertex> list2 = tQ2.toList();
150 assertEquals("1 - Has 1 vertexes ", 1, list1.size());
151 assertTrue("1 - traversal results in vnfc ", list1.contains(vnfc1));
152 assertEquals("2 - Has 1 vertexes ", 1, list2.size());
153 assertTrue("2 - traversal results in vce ", list2.contains(vce));
159 public void abstractEdgeToVertexTraversalSingleInRuleTest() throws AAIException {
161 Vertex vce = g.addV("aai-node-type","vce","vnf-id","vce").next();
162 Vertex pserver = g.addV("aai-node-type","pserver","hostname","a-name").next();
164 testEdgeRules.addEdge(g, vce, pserver);
166 QueryBuilder<Vertex> tQ1 = new TraversalQuery<>(loader, g, vce, testEdgeRules);
167 tQ1.createEdgeTraversal(EdgeType.COUSIN, "vnf", "pserver");
169 List<Vertex> list = tQ1.toList();
171 assertEquals("1 - Has 1 vertexes ", 1, list.size());
172 assertTrue("1 - traversal results in vnfc ", list.contains(pserver));
178 public void abstractEdgeToVertexMultiRuleTraversalTest() throws AAIException {
180 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
181 Vertex vnfc1 = g.addV("aai-node-type","vnfc","vnfc-name","a-name").next();
182 Vertex vnfc2 = g.addV("aai-node-type","vnfc","vnfc-name","b-name").next();
184 testEdgeRules.addEdge(g, gvnf, vnfc1);
185 testEdgeRules.addEdge(g, gvnf, vnfc2, "re-uses");
187 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
188 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "vnfc");
190 List<Vertex> list = tQ.toList();
192 assertEquals("Has 2 vertexes ", 2, list.size());
193 assertTrue("Has vertex on the default edge ", list.contains(vnfc1));
194 assertTrue("Has vertex on the re-uses edge ", list.contains(vnfc2));
200 public void abstractEdgeToVertexMultiRuleOutTraversalTest() throws AAIException {
202 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
203 Vertex pserver = g.addV("aai-node-type","pserver","hostname","a-name").next();
205 testEdgeRules.addEdge(g, gvnf, pserver);
206 testEdgeRules.addEdge(g, gvnf, pserver, "generic-vnf-pserver-B");
208 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
209 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "pserver");
211 List<Vertex> list = tQ.toList();
213 assertEquals("Has 2 vertexes ", 2, list.size());
214 assertTrue("result has pserver ", list.contains(pserver));
220 public void abstractEdgeToVertexMultiRuleInTraversalTest() throws AAIException {
222 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
223 Vertex complex = g.addV("aai-node-type","complex","physical-location-id","a-name").next();
225 testEdgeRules.addEdge(g, gvnf, complex);
226 testEdgeRules.addEdge(g, gvnf, complex, "complex-generic-vnf-B");
228 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
229 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "complex");
231 List<Vertex> list = tQ.toList();
233 assertEquals("Has 2 vertexes ", 2, list.size());
234 assertTrue("result has pserver ", list.contains(complex));