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
|
/**
* ============LICENSE_START=======================================================
* org.onap.aai
* ================================================================================
* Copyright © 2017-2018 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.onap.aai.rest.search;
import java.util.Map;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
import org.apache.tinkerpop.gremlin.structure.T;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import org.junit.Test;
import org.onap.aai.exceptions.AAIException;
import org.onap.aai.serialization.db.exceptions.NoEdgeRuleFoundException;
public class LinkedDevices_ComplicatedGVtoGV extends QueryTest {
public LinkedDevices_ComplicatedGVtoGV() throws AAIException, NoEdgeRuleFoundException {
super();
}
@Test
public void run() {
super.run();
}
@Override
protected void createGraph() throws AAIException, NoEdgeRuleFoundException {
Vertex gvnf1 =
graph.addVertex(T.label, "generic-vnf", T.id, "00", "aai-node-type", "generic-vnf",
"vnf-id", "gvnf1", "vnf-name", "genvnfname1", "nf-type", "sample-nf-type");
Vertex lint1 = graph.addVertex(T.label, "l-interface", T.id, "10", "aai-node-type",
"l-interface", "interface-name", "lint1", "is-port-mirrored", "true", "in-maint",
"true", "is-ip-unnumbered", "false");
Vertex loglink1 = graph.addVertex(T.label, "logical-link", T.id, "20", "aai-node-type",
"logical-link", "link-name", "loglink1", "in-maint", "false", "link-type", "sausage");
Vertex lint2 = graph.addVertex(T.label, "l-interface", T.id, "11", "aai-node-type",
"l-interface", "interface-name", "lint2", "is-port-mirrored", "true", "in-maint",
"true", "is-ip-unnumbered", "false");
Vertex vlan = graph.addVertex(T.label, "vlan", T.id, "30", "aai-node-type", "vlan",
"vlan-interface", "vlan1");
Vertex loglink2 = graph.addVertex(T.label, "logical-link", T.id, "21", "aai-node-type",
"logical-link", "link-name", "loglink2", "in-maint", "false", "link-type", "sausage");
Vertex lagint = graph.addVertex(T.label, "lag-interface", T.id, "40", "aai-node-type",
"lag-interface", "interface-name", "lagint1");
Vertex gvnf2 =
graph.addVertex(T.label, "generic-vnf", T.id, "01", "aai-node-type", "generic-vnf",
"vnf-id", "gvnf2", "vnf-name", "genvnfname2", "nf-type", "sample-nf-type");
GraphTraversalSource g = graph.traversal();
rules.addTreeEdge(g, gvnf1, lint1);
rules.addEdge(g, lint1, loglink1);
rules.addEdge(g, lint2, loglink1);
rules.addTreeEdge(g, lint2, vlan);
rules.addEdge(g, vlan, loglink2);
rules.addEdge(g, loglink2, lagint);
rules.addTreeEdge(g, gvnf2, lagint);
expectedResult.add(gvnf1);
expectedResult.add(gvnf2);
}
@Override
protected String getQueryName() {
return "linked-devices";
}
@Override
protected void addStartNode(GraphTraversal<Vertex, Vertex> g) {
g.has("aai-node-type", "generic-vnf").has("vnf-id", "gvnf1");
}
@Override
protected void addParam(Map<String, Object> params) {
// n/a for this query
}
}
|