undirected hyperedge list tests

Author: SpectraL519

tests/source/hgl/test_hyperedge_list.cpp

@@ -58,6 +58,13 @@ TEST_CASE_FIXTURE(
     CHECK_EQ(storage(sut).size(), constants::n_hyperedges - 1uz);
 }
 
+TEST_CASE_FIXTURE(test_undirected_hyperedge_list, "hyperedge_size should return 0 by default") {
+    sut_type sut{constants::n_vertices, constants::n_hyperedges};
+    CHECK(std::ranges::all_of(constants::hyperedge_ids_view, [&sut](const auto hyperedge_id) {
+        return sut.hyperedge_size(hyperedge_id) == 0uz;
+    }));
+}
+
 TEST_CASE_FIXTURE(
     test_undirected_hyperedge_list, "hyperedge_vertices should remove an empty view by default"
 ) {
@@ -67,6 +74,84 @@ TEST_CASE_FIXTURE(
     }));
 }
 
+TEST_CASE_FIXTURE(
+    test_undirected_hyperedge_list,
+    "bind(hyperedge, vertex) should add the vertex to the given hyperedge's storage only if the "
+    "they are not bound"
+) {
+    sut_type sut{constants::n_vertices, constants::n_hyperedges};
+    REQUIRE(std::ranges::empty(sut.hyperedge_vertices(constants::id1)));
+
+    sut.bind(constants::id1, constants::id1);
+    const auto vertices1 = sut.hyperedge_vertices(constants::id1) | std::ranges::to<std::vector>();
+    CHECK_EQ(sut.hyperedge_size(constants::id1), 1uz);
+    CHECK_EQ(std::ranges::size(vertices1), 1uz);
+    CHECK(std::ranges::contains(vertices1, constants::id1));
+    CHECK(std::ranges::equal(vertices1, storage(sut)[constants::id1]));
+
+    sut.bind(constants::id1, constants::id1);
+    const auto vertices2 = sut.hyperedge_vertices(constants::id1) | std::ranges::to<std::vector>();
+    CHECK_EQ(std::ranges::size(vertices2), 1uz);
+    CHECK(std::ranges::equal(vertices2, vertices1));
+}
+
+TEST_CASE_FIXTURE(
+    test_undirected_hyperedge_list,
+    "unbind(hyperedge, vertex) should remove the vertex from the given hyperedge's storage only if "
+    "the they are bound"
+) {
+    sut_type sut{constants::n_vertices, constants::n_hyperedges};
+    REQUIRE(std::ranges::empty(sut.hyperedge_vertices(constants::id1)));
+
+    sut.bind(constants::id1, constants::id1);
+    const auto vertices1 = sut.hyperedge_vertices(constants::id1) | std::ranges::to<std::vector>();
+    REQUIRE_EQ(sut.hyperedge_size(constants::id1), 1uz);
+    REQUIRE(std::ranges::contains(vertices1, constants::id1));
+
+    sut.unbind(constants::id1, constants::id2);
+    const auto vertices2 = sut.hyperedge_vertices(constants::id1) | std::ranges::to<std::vector>();
+    REQUIRE_EQ(std::ranges::size(vertices2), 1uz);
+    REQUIRE(std::ranges::equal(vertices2, vertices1));
+
+    sut.unbind(constants::id1, constants::id1);
+    CHECK(std::ranges::empty(sut.hyperedge_vertices(constants::id1)));
+}
+
+TEST_CASE_FIXTURE(
+    test_undirected_hyperedge_list,
+    "are_bound(hyperedge, vertex) should return true only when the given vertex is present in the "
+    "hyperedge's storage"
+) {
+    sut_type sut{constants::n_vertices, constants::n_hyperedges};
+    REQUIRE(std::ranges::empty(sut.hyperedge_vertices(constants::id1)));
+
+    sut.bind(constants::id1, constants::id1);
+    const auto vertices1 = sut.hyperedge_vertices(constants::id1) | std::ranges::to<std::vector>();
+    REQUIRE_EQ(sut.hyperedge_size(constants::id1), 1uz);
+    REQUIRE(std::ranges::contains(vertices1, constants::id1));
+
+    CHECK(sut.are_bound(constants::id1, constants::id1));
+    CHECK_FALSE(sut.are_bound(constants::id1, constants::id2));
+    CHECK_FALSE(sut.are_bound(constants::id2, constants::id1));
+}
+
+TEST_CASE_FIXTURE(
+    test_undirected_hyperedge_list,
+    "remove_vertex should unbind the given vertex from all hyperedges"
+) {
+    sut_type sut{constants::n_vertices, constants::n_hyperedges};
+    for (const auto hyperedge_id : constants::hyperedge_ids_view)
+        sut.bind(hyperedge_id, constants::id1);
+    REQUIRE(std::ranges::all_of(constants::hyperedge_ids_view, [&sut](const auto hyperedge_id) {
+        return sut.are_bound(hyperedge_id, constants::id1);
+    }));
+
+    sut.remove_vertex(constants::id1);
+    CHECK(std::ranges::all_of(constants::hyperedge_ids_view, [&sut](const auto hyperedge_id) {
+        return std::ranges::empty(sut.hyperedge_vertices(hyperedge_id));
+    }));
+}
+
 TEST_SUITE_END(); // test_hyperedge_list
 
 } // namespace hgl_testing