Differential D1781 Diff 6021 java/server/src/test/java/org/softwareheritage/graph/NeighborsTest.java
Changeset View
Changeset View
Standalone View
Standalone View
java/server/src/test/java/org/softwareheritage/graph/NeighborsTest.java
Show All 9 Lines | |||||
import org.softwareheritage.graph.SwhId; | import org.softwareheritage.graph.SwhId; | ||||
public class NeighborsTest extends GraphTest { | public class NeighborsTest extends GraphTest { | ||||
@Test | @Test | ||||
public void zeroNeighbor() { | public void zeroNeighbor() { | ||||
Graph graph = getGraph(); | Graph graph = getGraph(); | ||||
ArrayList<SwhId> expectedNodes = new ArrayList<>(); | ArrayList<SwhId> expectedNodes = new ArrayList<>(); | ||||
SwhId src1 = new SwhId("swh:1:snp:0000000000000000000000000000000000000020"); | SwhId src1 = new SwhId("swh:1:ori:0000000000000000000000000000000000000021"); | ||||
Endpoint endpoint1 = new Endpoint(graph, "backward", "*"); | Endpoint endpoint1 = new Endpoint(graph, "backward", "*"); | ||||
GraphTest.assertEqualsAnyOrder(expectedNodes, endpoint1.neighbors(src1)); | GraphTest.assertEqualsAnyOrder(expectedNodes, endpoint1.neighbors(src1)); | ||||
SwhId src2 = new SwhId("swh:1:cnt:0000000000000000000000000000000000000004"); | SwhId src2 = new SwhId("swh:1:cnt:0000000000000000000000000000000000000004"); | ||||
Endpoint endpoint2 = new Endpoint(graph, "forward", "*"); | Endpoint endpoint2 = new Endpoint(graph, "forward", "*"); | ||||
GraphTest.assertEqualsAnyOrder(expectedNodes, endpoint2.neighbors(src2)); | GraphTest.assertEqualsAnyOrder(expectedNodes, endpoint2.neighbors(src2)); | ||||
SwhId src3 = new SwhId("swh:1:cnt:0000000000000000000000000000000000000015"); | SwhId src3 = new SwhId("swh:1:cnt:0000000000000000000000000000000000000015"); | ||||
Show All 31 Lines | public void oneNeighbor() { | ||||
expectedNodes3.add(new SwhId("swh:1:rev:0000000000000000000000000000000000000013")); | expectedNodes3.add(new SwhId("swh:1:rev:0000000000000000000000000000000000000013")); | ||||
GraphTest.assertEqualsAnyOrder(expectedNodes3, endpoint3.neighbors(src3)); | GraphTest.assertEqualsAnyOrder(expectedNodes3, endpoint3.neighbors(src3)); | ||||
SwhId src4 = new SwhId("swh:1:rev:0000000000000000000000000000000000000009"); | SwhId src4 = new SwhId("swh:1:rev:0000000000000000000000000000000000000009"); | ||||
Endpoint endpoint4 = new Endpoint(graph, "backward", "rev:rev"); | Endpoint endpoint4 = new Endpoint(graph, "backward", "rev:rev"); | ||||
ArrayList<SwhId> expectedNodes4 = new ArrayList<>(); | ArrayList<SwhId> expectedNodes4 = new ArrayList<>(); | ||||
expectedNodes4.add(new SwhId("swh:1:rev:0000000000000000000000000000000000000013")); | expectedNodes4.add(new SwhId("swh:1:rev:0000000000000000000000000000000000000013")); | ||||
GraphTest.assertEqualsAnyOrder(expectedNodes4, endpoint4.neighbors(src4)); | GraphTest.assertEqualsAnyOrder(expectedNodes4, endpoint4.neighbors(src4)); | ||||
SwhId src5 = new SwhId("swh:1:snp:0000000000000000000000000000000000000020"); | |||||
Endpoint endpoint5 = new Endpoint(graph, "backward", "*"); | |||||
ArrayList<SwhId> expectedNodes5 = new ArrayList<>(); | |||||
expectedNodes5.add(new SwhId("swh:1:ori:0000000000000000000000000000000000000021")); | |||||
GraphTest.assertEqualsAnyOrder(expectedNodes5, endpoint5.neighbors(src5)); | |||||
} | } | ||||
@Test | @Test | ||||
public void twoNeighbors() { | public void twoNeighbors() { | ||||
Graph graph = getGraph(); | Graph 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", "*"); | ||||
▲ Show 20 Lines • Show All 48 Lines • Show Last 20 Lines |