2 * ============LICENSE_START=======================================================
4 * ================================================================================
5 * Copyright (C) 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=========================================================
21 package org.onap.aai.rest.search;
25 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
26 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
27 import org.apache.tinkerpop.gremlin.structure.T;
28 import org.apache.tinkerpop.gremlin.structure.Vertex;
29 import org.junit.Test;
31 import org.onap.aai.exceptions.AAIException;
32 import org.onap.aai.serialization.db.exceptions.NoEdgeRuleFoundException;
34 public class ColocatedDevicesQueryTest extends QueryTest {
35 public ColocatedDevicesQueryTest() throws AAIException, NoEdgeRuleFoundException {
44 protected void createGraph() throws AAIException, NoEdgeRuleFoundException {
47 //Set up the test graph
48 Vertex complex1 = graph.addVertex(T.label, "complex", T.id, "0", "aai-node-type", "complex", "physical-location-id", "clli1");
49 Vertex pserver1 = graph.addVertex(T.label, "pserver", T.id, "1", "aai-node-type", "pserver", "hostname", "pservername1");
50 Vertex pserverint1 = graph.addVertex(T.label, "p-interface", T.id, "2", "aai-node-type", "p-interface", "interface-name", "xe0/0/0");
51 Vertex pnf1 = graph.addVertex(T.label, "pnf", T.id, "3", "aai-node-type", "pnf", "pnf-name", "pnfname1");
52 Vertex pnfint1 = graph.addVertex(T.label, "p-interface", T.id, "4", "aai-node-type", "p-interface", "interface-name", "ge0/0/0");
53 Vertex plink1 = graph.addVertex(T.label, "physical-link", T.id, "5", "aai-node-type", "physical-link", "link-name", "ge0/0/0-to-xe0/0/0");
55 Vertex complex2 = graph.addVertex(T.label, "complex", T.id, "6", "aai-node-type", "complex", "physical-location-id", "clli2");
56 Vertex pserver2 = graph.addVertex(T.label, "pserver", T.id, "7", "aai-node-type", "pserver", "hostname", "pservername2");
57 Vertex pserverint2 = graph.addVertex(T.label, "p-interface", T.id, "8", "aai-node-type", "p-interface", "interface-name", "xe0/0/1");
58 Vertex pserver3 = graph.addVertex(T.label, "pserver", T.id, "9", "aai-node-type", "pserver", "hostname", "pservername3");
59 Vertex pserverint3 = graph.addVertex(T.label, "p-interface", T.id, "10", "aai-node-type", "p-interface", "interface-name", "xe0/0/3");
60 Vertex plink2 = graph.addVertex(T.label, "physical-link", T.id, "11", "aai-node-type", "physical-link", "link-name", "xe0/0/1-to-xe0/0/3");
62 Vertex pnf2 = graph.addVertex(T.label, "pnf", T.id, "12", "aai-node-type", "pnf", "pnf-name", "pnfname2");
63 Vertex pnfint2 = graph.addVertex(T.label, "p-interface", T.id, "13", "aai-node-type", "p-interface", "interface-name", "ge0/0/2");
64 Vertex pnf3 = graph.addVertex(T.label, "pnf", T.id, "14", "aai-node-type", "pnf", "pnf-name", "pnfname3");
65 Vertex pnfint3 = graph.addVertex(T.label, "p-interface", T.id, "15", "aai-node-type", "p-interface", "interface-name", "ge0/0/3");
66 Vertex plink3 = graph.addVertex(T.label, "physical-link", T.id, "16", "aai-node-type", "physical-link", "link-name", "ge0/0/2-to-ge0/0/3");
68 GraphTraversalSource g = graph.traversal();
69 rules.addEdge(g, pserver1, complex1);
70 rules.addTreeEdge(g, pserver1, pserverint1);
71 rules.addEdge(g, pnf1, complex1);
72 rules.addTreeEdge(g, pnf1, pnfint1);
73 rules.addEdge(g, pserverint1, plink1);
74 rules.addEdge(g, pnfint1, plink1);
76 rules.addEdge(g, pserver2, complex1);
77 rules.addTreeEdge(g, pserver2, pserverint2);
78 rules.addEdge(g, pserver3, complex2);
79 rules.addTreeEdge(g, pserver3, pserverint3);
80 rules.addEdge(g, pserverint2, plink2);
81 rules.addEdge(g, pserverint3, plink2);
83 rules.addEdge(g, pnf2, complex2);
84 rules.addTreeEdge(g, pnf2, pnfint2);
85 rules.addEdge(g, pnf3, complex2);
86 rules.addTreeEdge(g, pnf3, pnfint3);
87 rules.addEdge(g, pnfint2, plink3);
88 rules.addEdge(g, pnfint3, plink3);
91 expectedResult.add(pnf1);
92 expectedResult.add(pnfint1);
93 expectedResult.add(pserver1);
94 expectedResult.add(pserverint1);
95 expectedResult.add(plink1);
96 expectedResult.add(pserver2);
97 expectedResult.add(pserverint2);
98 expectedResult.add(plink2);
103 protected String getQueryName() {
104 return "colocated-devices";
107 protected void addStartNode(GraphTraversal<Vertex, Vertex> g) {
108 g.has("hostname", "pservername1");
112 protected void addParam(Map<String, Object> params) {