2 * ============LICENSE_START=======================================================
4 * ================================================================================
5 * Copyright © 2017 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 * ECOMP is a trademark and service mark of AT&T Intellectual Property.
22 package org.onap.aai.query.builder;
24 import static org.junit.Assert.assertEquals;
25 import static org.junit.Assert.assertTrue;
27 import java.io.UnsupportedEncodingException;
29 import java.net.URISyntaxException;
30 import java.util.List;
32 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
33 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__;
34 import org.apache.tinkerpop.gremlin.structure.Edge;
35 import org.apache.tinkerpop.gremlin.structure.Vertex;
36 import org.junit.Test;
37 import org.onap.aai.db.props.AAIProperties;
38 import org.onap.aai.exceptions.AAIException;
39 import org.onap.aai.serialization.db.EdgeType;
41 public class TraversalQueryTest extends QueryBuilderTestAbstraction {
45 protected QueryBuilder<Edge> getNewEdgeTraversal(Vertex v) {
46 return new TraversalQuery<>(loader, g, v, testEdgeRules);
50 protected QueryBuilder<Edge> getNewEdgeTraversal() {
51 return new TraversalQuery<>(loader, g, testEdgeRules);
55 protected QueryBuilder<Vertex> getNewVertexTraversal(Vertex v) {
56 return new TraversalQuery<>(loader, g, v, testEdgeRules);
60 protected QueryBuilder<Vertex> getNewVertexTraversal() {
61 return new TraversalQuery<>(loader, g, testEdgeRules);
65 public void unionQuery() {
66 QueryBuilder<Vertex> tQ = new TraversalQuery<>(loader, g);
67 QueryBuilder<Vertex> tQ2 = new TraversalQuery<>(loader, g);
68 QueryBuilder<Vertex> tQ3 = new TraversalQuery<>(loader, g);
70 tQ2.getVerticesByProperty("test1", "value1"),
71 tQ3.getVerticesByIndexedProperty("test2", "value2"));
73 GraphTraversal<Vertex, Vertex> expected = __.<Vertex>start()
74 .union(__.has("test1", "value1"),__.has("test2", "value2"));
76 assertEquals("they are equal", expected, tQ.getQuery());
82 public void traversalClones() throws UnsupportedEncodingException, AAIException, URISyntaxException {
83 QueryBuilder<Vertex> tQ = new TraversalQuery<>(loader, g);
84 QueryBuilder<Vertex> builder = tQ.createQueryFromURI(new URI("network/test-objects/test-object/key1")).getQueryBuilder();
85 GraphTraversal<Vertex, Vertex> expected = __.<Vertex>start().has("vnf-id", "key1").has("aai-node-type", "test-object");
86 GraphTraversal<Vertex, Vertex> containerExpected = __.<Vertex>start().has("aai-node-type", "test-object");
88 assertEquals("query object", expected.toString(), builder.getQuery().toString());
89 assertEquals("container query object", containerExpected.toString(), builder.getContainerQuery().getQuery().toString());
95 public void nestedTraversalClones() throws UnsupportedEncodingException, AAIException, URISyntaxException {
97 QueryBuilder<Vertex> tQ = new TraversalQuery<>(loader, g);
98 QueryBuilder<Vertex> builder = tQ.createQueryFromURI(new URI("network/generic-vnfs/generic-vnf/key1/l-interfaces/l-interface/key2")).getQueryBuilder();
99 GraphTraversal<Vertex, Vertex> expected = __.<Vertex>start().has("vnf-id", "key1").has("aai-node-type", "generic-vnf").out("hasLInterface").has(AAIProperties.NODE_TYPE, "l-interface").has("interface-name", "key2");
100 GraphTraversal<Vertex, Vertex> containerExpected = __.<Vertex>start().has("vnf-id", "key1").has("aai-node-type", "generic-vnf").out("hasLInterface").has(AAIProperties.NODE_TYPE, "l-interface");
102 assertEquals("query object", expected.toString(), builder.getQuery().toString());
103 assertEquals("container query object", containerExpected.toString(), builder.getContainerQuery().getQuery().toString());
109 public void abstractEdgeToVertexTraversalTest() throws AAIException {
111 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
112 Vertex vnfc1 = g.addV("aai-node-type","vnfc","vnfc-name","a-name").next();
114 testEdgeRules.addEdge(g, gvnf, vnfc1);
116 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
117 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "vnfc");
119 List<Vertex> list = tQ.toList();
121 assertEquals("Has 1 vertexes ", 1, list.size());
122 assertTrue("Has vertex on the default edge ", list.contains(vnfc1));
128 public void abstractEdgeToVertexTraversalSingleOutRuleTest() throws AAIException {
130 Vertex vce = g.addV("aai-node-type","vce","vnf-id","vce").next();
131 Vertex vnfc1 = g.addV("aai-node-type","vnfc","vnfc-name","a-name").next();
133 testEdgeRules.addEdge(g, vce, vnfc1);
135 QueryBuilder<Vertex> tQ1 = new TraversalQuery<>(loader, g, vce, testEdgeRules);
136 tQ1.createEdgeTraversal(EdgeType.COUSIN, "vnf", "vnfc");
138 QueryBuilder<Vertex> tQ2 = new TraversalQuery<>(loader, g, vnfc1, testEdgeRules);
139 tQ2.createEdgeTraversal(EdgeType.COUSIN, "vnfc", "vnf");
141 List<Vertex> list1 = tQ1.toList();
142 List<Vertex> list2 = tQ2.toList();
144 assertEquals("1 - Has 1 vertexes ", 1, list1.size());
145 assertTrue("1 - traversal results in vnfc ", list1.contains(vnfc1));
146 assertEquals("2 - Has 1 vertexes ", 1, list2.size());
147 assertTrue("2 - traversal results in vce ", list2.contains(vce));
153 public void abstractEdgeToVertexTraversalSingleInRuleTest() throws AAIException {
155 Vertex vce = g.addV("aai-node-type","vce","vnf-id","vce").next();
156 Vertex pserver = g.addV("aai-node-type","pserver","hostname","a-name").next();
158 testEdgeRules.addEdge(g, vce, pserver);
160 QueryBuilder<Vertex> tQ1 = new TraversalQuery<>(loader, g, vce, testEdgeRules);
161 tQ1.createEdgeTraversal(EdgeType.COUSIN, "vnf", "pserver");
163 List<Vertex> list = tQ1.toList();
165 assertEquals("1 - Has 1 vertexes ", 1, list.size());
166 assertTrue("1 - traversal results in vnfc ", list.contains(pserver));
172 public void abstractEdgeToVertexMultiRuleTraversalTest() throws AAIException {
174 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
175 Vertex vnfc1 = g.addV("aai-node-type","vnfc","vnfc-name","a-name").next();
176 Vertex vnfc2 = g.addV("aai-node-type","vnfc","vnfc-name","b-name").next();
178 testEdgeRules.addEdge(g, gvnf, vnfc1);
179 testEdgeRules.addEdge(g, gvnf, vnfc2, "re-uses");
181 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
182 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "vnfc");
184 List<Vertex> list = tQ.toList();
186 assertEquals("Has 2 vertexes ", 2, list.size());
187 assertTrue("Has vertex on the default edge ", list.contains(vnfc1));
188 assertTrue("Has vertex on the re-uses edge ", list.contains(vnfc2));
194 public void abstractEdgeToVertexMultiRuleOutTraversalTest() throws AAIException {
196 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
197 Vertex pserver = g.addV("aai-node-type","pserver","hostname","a-name").next();
199 testEdgeRules.addEdge(g, gvnf, pserver);
200 testEdgeRules.addEdge(g, gvnf, pserver, "generic-vnf-pserver-B");
202 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
203 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "pserver");
205 List<Vertex> list = tQ.toList();
207 assertEquals("Has 2 vertexes ", 2, list.size());
208 assertTrue("result has pserver ", list.contains(pserver));
214 public void abstractEdgeToVertexMultiRuleInTraversalTest() throws AAIException {
216 Vertex gvnf = g.addV("aai-node-type","generic-vnf","vnf-id","gvnf").next();
217 Vertex complex = g.addV("aai-node-type","complex","physical-location-id","a-name").next();
219 testEdgeRules.addEdge(g, gvnf, complex);
220 testEdgeRules.addEdge(g, gvnf, complex, "complex-generic-vnf-B");
222 QueryBuilder<Vertex> tQ = getNewVertexTraversal(gvnf);
223 tQ.createEdgeTraversal(EdgeType.COUSIN, "vnf", "complex");
225 List<Vertex> list = tQ.toList();
227 assertEquals("Has 2 vertexes ", 2, list.size());
228 assertTrue("result has pserver ", list.contains(complex));