aboutsummaryrefslogtreecommitdiffstats
path: root/aai-core/src/test/java/org/onap/aai/serialization/engines/query/GraphTraversalQueryEngine_needsFakeEdgeRulesTest.java
blob: 8c6035587c311f8d5aaf93baa76dd84bc041e3ca (plain)
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
/**
 * ============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.serialization.engines.query;

import static org.junit.Assert.*;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
import org.apache.tinkerpop.gremlin.structure.Graph;
import org.apache.tinkerpop.gremlin.structure.T;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import org.apache.tinkerpop.gremlin.tinkergraph.structure.TinkerGraph;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.onap.aai.config.ConfigConfiguration;
import org.onap.aai.edges.EdgeIngestor;
import org.onap.aai.exceptions.AAIException;
import org.onap.aai.serialization.db.AAICoreFakeEdgesConfigTranslator;
import org.onap.aai.serialization.db.EdgeSerializer;
import org.onap.aai.setup.SchemaLocationsBean;
import org.onap.aai.setup.SchemaVersions;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.test.annotation.DirtiesContext;
import org.springframework.test.context.ContextConfiguration;
import org.springframework.test.context.junit4.SpringJUnit4ClassRunner;

@RunWith(SpringJUnit4ClassRunner.class)
@ContextConfiguration(
        classes = {ConfigConfiguration.class, AAICoreFakeEdgesConfigTranslator.class, EdgeIngestor.class,
                EdgeSerializer.class})
@DirtiesContext
public class GraphTraversalQueryEngine_needsFakeEdgeRulesTest {
    @Autowired
    EdgeSerializer edgeSer;

    @Test
    public void testFindDeletable() throws AAIException {
        // setup
        Graph graph = TinkerGraph.open();
        Vertex parent = graph.addVertex(T.id, "00", "aai-node-type", "test-parent");
        Vertex child = graph.addVertex(T.id, "10", "aai-node-type", "test-child");
        Vertex cousin = graph.addVertex(T.id, "20", "aai-node-type", "test-cousin");
        Vertex grandchild = graph.addVertex(T.id, "30", "aai-node-type", "test-grandchild");

        GraphTraversalSource g = graph.traversal();

        edgeSer.addTreeEdge(g, parent, child); // delete-other-v=none, no cascade
        edgeSer.addTreeEdge(g, child, grandchild); // d-o-v=out, yes from child
        edgeSer.addEdge(g, cousin, child); // d-o-v=out, yes from cousin

        List<Vertex> parentExpected = new ArrayList<>(Arrays.asList(parent));
        List<Vertex> childExpected = new ArrayList<>(Arrays.asList(child, grandchild));
        List<Vertex> cousinExpected = new ArrayList<>(Arrays.asList(cousin, child, grandchild));

        GraphTraversalQueryEngine engine = new GraphTraversalQueryEngine(g);

        // tests
        List<Vertex> parentDeletes = engine.findDeletable(parent);
        assertTrue(parentExpected.containsAll(parentDeletes) && parentDeletes.containsAll(parentExpected));

        List<Vertex> childDeletes = engine.findDeletable(child);
        assertTrue(childExpected.containsAll(childDeletes) && childDeletes.containsAll(childExpected));

        List<Vertex> cousinDeletes = engine.findDeletable(cousin);
        assertTrue(cousinExpected.containsAll(cousinDeletes) && cousinDeletes.containsAll(cousinExpected));
    }
}