Page MenuHomeSoftware Heritage
Differential D6953 Diff 25202 java/src/test/java/org/softwareheritage/graph/NeighborsTest.java

Changeset View

Standalone View

View Options

java/src/test/java/org/softwareheritage/graph/NeighborsTest.java

package org.softwareheritage.graph; package org.softwareheritage.graph;
import java.util.ArrayList; import java.util.ArrayList;
import org.junit.jupiter.api.Test; import org.junit.jupiter.api.Test;
import org.softwareheritage.graph.server.Endpoint; import org.softwareheritage.graph.server.Endpoint;
// Avoid warnings concerning Endpoint.Output.result manual cast // Avoid warnings concerning Endpoint.Output.result manual cast
@SuppressWarnings("unchecked") @SuppressWarnings("unchecked")
public class NeighborsTest extends GraphTest { public class NeighborsTest extends GraphTest {
@Test @Test
public void zeroNeighbor() { public void zeroNeighbor() {
Graph graph = getGraph(); SwhBidirectionalGraph graph = getGraph();
ArrayList<SWHID> expectedNodes = new ArrayList<>(); ArrayList<SWHID> expectedNodes = new ArrayList<>();
SWHID src1 = new SWHID("swh:1:ori:0000000000000000000000000000000000000021"); SWHID src1 = new SWHID("swh:1:ori:0000000000000000000000000000000000000021");
Endpoint endpoint1 = new Endpoint(graph, "backward", "*"); Endpoint endpoint1 = new Endpoint(graph, "backward", "*");
ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result; ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result;
GraphTest.assertEqualsAnyOrder(expectedNodes, actuals1); GraphTest.assertEqualsAnyOrder(expectedNodes, actuals1);
SWHID src2 = new SWHID("swh:1:cnt:0000000000000000000000000000000000000004"); SWHID src2 = new SWHID("swh:1:cnt:0000000000000000000000000000000000000004");
Show All 14 Lines public void zeroNeighbor() {
SWHID src5 = new SWHID("swh:1:dir:0000000000000000000000000000000000000008"); SWHID src5 = new SWHID("swh:1:dir:0000000000000000000000000000000000000008");
Endpoint endpoint5 = new Endpoint(graph, "forward", "snp:*,rev:*,rel:*"); Endpoint endpoint5 = new Endpoint(graph, "forward", "snp:*,rev:*,rel:*");
ArrayList<SWHID> actuals5 = (ArrayList) endpoint5.neighbors(new Endpoint.Input(src5)).result; ArrayList<SWHID> actuals5 = (ArrayList) endpoint5.neighbors(new Endpoint.Input(src5)).result;
GraphTest.assertEqualsAnyOrder(expectedNodes, actuals5); GraphTest.assertEqualsAnyOrder(expectedNodes, actuals5);
} }
@Test @Test
public void oneNeighbor() { public void oneNeighbor() {
Graph graph = getGraph(); SwhBidirectionalGraph graph = getGraph();
SWHID src1 = new SWHID("swh:1:rev:0000000000000000000000000000000000000003"); SWHID src1 = new SWHID("swh:1:rev:0000000000000000000000000000000000000003");
Endpoint endpoint1 = new Endpoint(graph, "forward", "*"); Endpoint endpoint1 = new Endpoint(graph, "forward", "*");
ArrayList<SWHID> expectedNodes1 = new ArrayList<>(); ArrayList<SWHID> expectedNodes1 = new ArrayList<>();
expectedNodes1.add(new SWHID("swh:1:dir:0000000000000000000000000000000000000002")); expectedNodes1.add(new SWHID("swh:1:dir:0000000000000000000000000000000000000002"));
ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result; ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result;
GraphTest.assertEqualsAnyOrder(expectedNodes1, actuals1); GraphTest.assertEqualsAnyOrder(expectedNodes1, actuals1);
Show All 23 Lines public void oneNeighbor() {
ArrayList<SWHID> expectedNodes5 = new ArrayList<>(); ArrayList<SWHID> expectedNodes5 = new ArrayList<>();
expectedNodes5.add(new SWHID("swh:1:ori:0000000000000000000000000000000000000021")); expectedNodes5.add(new SWHID("swh:1:ori:0000000000000000000000000000000000000021"));
ArrayList<SWHID> actuals5 = (ArrayList) endpoint5.neighbors(new Endpoint.Input(src5)).result; ArrayList<SWHID> actuals5 = (ArrayList) endpoint5.neighbors(new Endpoint.Input(src5)).result;
GraphTest.assertEqualsAnyOrder(expectedNodes5, actuals5); GraphTest.assertEqualsAnyOrder(expectedNodes5, actuals5);
} }
@Test @Test
public void twoNeighbors() { public void twoNeighbors() {
Graph graph = getGraph(); SwhBidirectionalGraph graph = getGraph();
SWHID src1 = new SWHID("swh:1:snp:0000000000000000000000000000000000000020"); SWHID src1 = new SWHID("swh:1:snp:0000000000000000000000000000000000000020");
Endpoint endpoint1 = new Endpoint(graph, "forward", "*"); Endpoint endpoint1 = new Endpoint(graph, "forward", "*");
ArrayList<SWHID> expectedNodes1 = new ArrayList<>(); ArrayList<SWHID> expectedNodes1 = new ArrayList<>();
expectedNodes1.add(new SWHID("swh:1:rel:0000000000000000000000000000000000000010")); expectedNodes1.add(new SWHID("swh:1:rel:0000000000000000000000000000000000000010"));
expectedNodes1.add(new SWHID("swh:1:rev:0000000000000000000000000000000000000009")); expectedNodes1.add(new SWHID("swh:1:rev:0000000000000000000000000000000000000009"));
ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result; ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result;
GraphTest.assertEqualsAnyOrder(expectedNodes1, actuals1); GraphTest.assertEqualsAnyOrder(expectedNodes1, actuals1);
Show All 20 Lines public void twoNeighbors() {
expectedNodes4.add(new SWHID("swh:1:snp:0000000000000000000000000000000000000020")); expectedNodes4.add(new SWHID("swh:1:snp:0000000000000000000000000000000000000020"));
expectedNodes4.add(new SWHID("swh:1:rel:0000000000000000000000000000000000000010")); expectedNodes4.add(new SWHID("swh:1:rel:0000000000000000000000000000000000000010"));
ArrayList<SWHID> actuals4 = (ArrayList) endpoint4.neighbors(new Endpoint.Input(src4)).result; ArrayList<SWHID> actuals4 = (ArrayList) endpoint4.neighbors(new Endpoint.Input(src4)).result;
GraphTest.assertEqualsAnyOrder(expectedNodes4, actuals4); GraphTest.assertEqualsAnyOrder(expectedNodes4, actuals4);
} }
@Test @Test
public void threeNeighbors() { public void threeNeighbors() {
Graph graph = getGraph(); SwhBidirectionalGraph graph = getGraph();
SWHID src1 = new SWHID("swh:1:dir:0000000000000000000000000000000000000008"); SWHID src1 = new SWHID("swh:1:dir:0000000000000000000000000000000000000008");
Endpoint endpoint1 = new Endpoint(graph, "forward", "*"); Endpoint endpoint1 = new Endpoint(graph, "forward", "*");
ArrayList<SWHID> expectedNodes1 = new ArrayList<>(); ArrayList<SWHID> expectedNodes1 = new ArrayList<>();
expectedNodes1.add(new SWHID("swh:1:dir:0000000000000000000000000000000000000006")); expectedNodes1.add(new SWHID("swh:1:dir:0000000000000000000000000000000000000006"));
expectedNodes1.add(new SWHID("swh:1:cnt:0000000000000000000000000000000000000001")); expectedNodes1.add(new SWHID("swh:1:cnt:0000000000000000000000000000000000000001"));
expectedNodes1.add(new SWHID("swh:1:cnt:0000000000000000000000000000000000000007")); expectedNodes1.add(new SWHID("swh:1:cnt:0000000000000000000000000000000000000007"));
ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result; ArrayList<SWHID> actuals1 = (ArrayList) endpoint1.neighbors(new Endpoint.Input(src1)).result;
Show All 12 Lines
About · Developer information · Legal