aai-traversal/src/test/java/org/onap/aai/rest/search/PnfTopologyQueryTest.java

   1 /**
   2  * ============LICENSE_START=======================================================
   3  * org.onap.aai
   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
  10  *
  11  *    http://www.apache.org/licenses/LICENSE-2.0
  12  *
  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=========================================================
  19  */
  20 package org.onap.aai.rest.search;
  21 import java.util.Map;
  22
  23 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
  24 import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
  25 import org.apache.tinkerpop.gremlin.structure.T;
  26 import org.apache.tinkerpop.gremlin.structure.Vertex;
  27 import org.junit.Test;
  28
  29 import org.onap.aai.exceptions.AAIException;
  30 import org.onap.aai.serialization.db.exceptions.NoEdgeRuleFoundException;
  31
  32 public class PnfTopologyQueryTest extends QueryTest {
  33
  34         public PnfTopologyQueryTest() throws AAIException, NoEdgeRuleFoundException {
  35                 super();
  36         }
  37
  38         @Test
  39         public void run() {
  40                 super.run();
  41         }
  42
  43         @Override
  44         protected void createGraph() throws AAIException, NoEdgeRuleFoundException {
  45                 //Set up the test graph
  46                                 Vertex pnf1 = graph.addVertex(T.label, "pnf", T.id, "0", "aai-node-type", "pnf", "pnf-name", "pnf1name");
  47                                 Vertex complex = graph.addVertex(T.label, "complex", T.id, "1", "aai-node-type", "complex", "physical-location-id", "clli");
  48                                 Vertex pnf1int1 = graph.addVertex(T.label, "p-interface", T.id, "2", "aai-node-type", "p-interface", "interface-name", "ge0/0/0");
  49                                 Vertex pnf1int2 = graph.addVertex(T.label, "p-interface", T.id, "3", "aai-node-type", "p-interface", "interface-name", "ge0/0/1");
  50                                 Vertex pnf1int3 = graph.addVertex(T.label, "p-interface", T.id, "4", "aai-node-type", "p-interface", "interface-name", "ge0/0/2");
  51                                 Vertex pserver = graph.addVertex(T.label, "pserver", T.id, "5", "aai-node-type", "pserver", "hostname", "pservername");
  52                                 Vertex pserverint = graph.addVertex(T.label, "p-interface", T.id, "6", "aai-node-type", "p-interface", "interface-name", "xe0/0/0");
  53                                 Vertex plink1 = graph.addVertex(T.label, "physical-link", T.id, "7", "aai-node-type", "physical-link", "link-name", "ge0/0/0-to-xe0/0/0");
  54                                 Vertex pnf2 = graph.addVertex(T.label, "pnf", T.id, "8", "aai-node-type", "pnf", "pnf-name", "pnf2name");
  55                                 Vertex pnf2int = graph.addVertex(T.label, "p-interface", T.id, "9", "aai-node-type", "p-interface", "interface-name", "ge0/1/0");
  56                                 Vertex plink2 = graph.addVertex(T.label, "physical-link", T.id, "10", "aai-node-type", "physical-link", "link-name", "ge0/0/1-to-ge0/1/0");
  57                                 Vertex vserver = graph.addVertex(T.label, "vserver", T.id, "11", "aai-node-type", "vserver", "vserver-name", "vservername");
  58                                 Vertex pserverint2 = graph.addVertex(T.label, "p-interface", T.id, "12", "aai-node-type", "p-interface", "interface-name", "xe0/0/1");
  59                                 Vertex pnf2int2 = graph.addVertex(T.label, "p-interface", T.id, "13", "aai-node-type", "p-interface", "interface-name", "ge0/1/0");
  60
  61                                 GraphTraversalSource g = graph.traversal();
  62                                 rules.addEdge(g, pnf1, complex);
  63                                 rules.addTreeEdge(g, pnf1, pnf1int1);
  64                                 rules.addTreeEdge(g, pnf1, pnf1int2);
  65                                 rules.addTreeEdge(g, pnf1, pnf1int3);
  66                                 rules.addEdge(g, pserver, complex);
  67                                 rules.addTreeEdge(g, pserver, pserverint);
  68                                 rules.addEdge(g, pnf1int1, plink1);
  69                                 rules.addEdge(g, pserverint, plink1);
  70                                 rules.addEdge(g, pnf2, complex);
  71                                 rules.addTreeEdge(g, pnf2, pnf2int);
  72                                 rules.addEdge(g, pnf1int2, plink2);
  73                                 rules.addEdge(g, pnf2int, plink2);
  74                                 rules.addEdge(g, vserver, pserver);
  75                                 rules.addTreeEdge(g, pserver, pserverint2);
  76                                 rules.addTreeEdge(g, pnf2, pnf2int2);
  77
  78                                 expectedResult.add(pnf1);
  79                                 expectedResult.add(complex);
  80                                 expectedResult.add(pnf1int1);
  81                                 expectedResult.add(pnf1int2);
  82                                 expectedResult.add(pserver);
  83                                 expectedResult.add(pserverint);
  84                                 expectedResult.add(plink1);
  85                                 expectedResult.add(pnf2);
  86                                 expectedResult.add(pnf2int);
  87                                 expectedResult.add(plink2);
  88         }
  89
  90         @Override
  91         protected String getQueryName() {
  92                 // TODO Auto-generated method stub
  93                 return "pnf-topology";
  94         }
  95         @Override
  96         protected void addStartNode(GraphTraversal<Vertex, Vertex> g) {
  97                 g.has("pnf-name", "pnf1name");
  98         }
  99
 100         @Override
 101         protected void addParam(Map<String, Object> params) {
 102                 return;
 103         }
 104 }