blob: 14d3f3aeb039d6ab810db00fef0e33c2d33b3a46 (
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
|
/*-
* ============LICENSE_START=======================================================
* SDC
* ================================================================================
* Copyright (C) 2019 Nokia. 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.openecomp.sdc.be.dao.neo4j;
import static com.google.code.beanmatchers.BeanMatchers.hasValidGettersAndSetters;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertThat;
import org.junit.Test;
import org.openecomp.sdc.be.resources.data.ArtifactData;
public class GraphNeighbourTableTest {
@Test
public void shouldHaveValidGettersAndSetters() {
assertThat(GraphNeighbourTable.class, hasValidGettersAndSetters());
}
@Test
public void shouldAddEdge() {
GraphNeighbourTable graphNeighbourTable = new GraphNeighbourTable();
NodeRelation directedEdge = new NodeRelation(1, 1, null);
graphNeighbourTable.addEdge(directedEdge);
assertEquals(directedEdge, graphNeighbourTable.getDirectedEdges().get(0));
}
@Test
public void shouldAddNode() {
GraphNeighbourTable graphNeighbourTable = new GraphNeighbourTable();
ArtifactData node = new ArtifactData();
int index = graphNeighbourTable.addNode(node);
assertEquals(node, graphNeighbourTable.getNodes().get(0));
assertEquals(index, 0);
}
}
|