warrence/grapherity
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Change all graph tests to pub to avoid unused-warnings

Browse Source
This commit is contained in:
warrence
2026-09-02 09:30:37 +02:00
parent 0ff830ef48
commit 5825ef3b47
5 changed files with 78 additions and 74 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/testing/graph_topology_deletion_testing.rs
+18 -17
View File
@@ -40,7 +40,7 @@ macro_rules! graph_topology_deletion_tests {
};
}
pub(crate) fn delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>() {
let (mut graph, v) = G::single_vertex();
assert_eq!(
graph.vertex_count(),
@@ -55,7 +55,7 @@ pub(crate) fn delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>()
);
}
pub(crate) fn delete_vertex_loop<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_vertex_loop<G: GraphTopologyDeletion + GraphTopologyAddition>() {
let (mut graph, v, _) = G::loop_edge();
assert_eq!(
graph.vertex_count(),
@@ -77,7 +77,7 @@ pub(crate) fn delete_vertex_loop<G: GraphTopologyDeletion + GraphTopologyAdditio
assert_eq!(graph.edge_count(), 0, "unexpected edge count after delete");
}
pub(crate) fn delete_vertex_invalid_index<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_vertex_invalid_index<G: GraphTopologyDeletion + GraphTopologyAddition>() {
let (mut graph, v) = G::single_vertex();
graph.delete_vertex(v);
let result =
@@ -85,7 +85,7 @@ pub(crate) fn delete_vertex_invalid_index<G: GraphTopologyDeletion + GraphTopolo
assert!(result.is_err(), "second deletion should panic");
}
pub(crate) fn delete_vertex_connected<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn delete_vertex_connected<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
{
@@ -135,7 +135,7 @@ where
}
}
pub(crate) fn delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>() {
let (mut graph, vertices, e) = G::single_edge();
assert_eq!(
graph.vertex_count(),
@@ -180,7 +180,7 @@ pub(crate) fn delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>() {
);
}
pub(crate) fn delete_edge_loop<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_edge_loop<G: GraphTopologyDeletion + GraphTopologyAddition>() {
let (mut graph, v, e) = G::loop_edge();
assert_eq!(
graph.vertex_count(),
@@ -207,7 +207,7 @@ pub(crate) fn delete_edge_loop<G: GraphTopologyDeletion + GraphTopologyAddition>
assert_eq!(graph.degree(v), 0, "unexpected vertex degree after delete");
}
pub(crate) fn delete_edge_multiple<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_edge_multiple<G: GraphTopologyDeletion + GraphTopologyAddition>() {
const K: usize = 2;
let (mut graph, vertices, edges) = G::multiple_edges::<K>();
assert_eq!(
@@ -257,7 +257,7 @@ pub(crate) fn delete_edge_multiple<G: GraphTopologyDeletion + GraphTopologyAddit
);
}
pub(crate) fn delete_edge_invalid_index<G: GraphTopologyDeletion + GraphTopologyAddition>() {
pub fn delete_edge_invalid_index<G: GraphTopologyDeletion + GraphTopologyAddition>() {
let (mut graph, _, e) = G::single_edge();
graph.delete_edge(e);
let result =
@@ -265,7 +265,7 @@ pub(crate) fn delete_edge_invalid_index<G: GraphTopologyDeletion + GraphTopology
assert!(result.is_err(), "second deletion should panic");
}
pub(crate) fn vertices_after_delete<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn vertices_after_delete<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
{
@@ -297,7 +297,7 @@ where
}
}
pub(crate) fn incident_vertices_after_delete_edge<
pub fn incident_vertices_after_delete_edge<
G: GraphTopologyDeletion + GraphTopologyAddition,
>()
where
@@ -316,7 +316,7 @@ where
}
}
pub(crate) fn edges_after_delete<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn edges_after_delete<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Edge: Debug,
{
@@ -344,7 +344,7 @@ where
}
}
pub(crate) fn incident_edges_after_delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn incident_edges_after_delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
G::Edge: Debug,
@@ -378,7 +378,7 @@ where
}
}
pub(crate) fn incident_edges_after_delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn incident_edges_after_delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
G::Edge: Debug,
@@ -412,7 +412,7 @@ where
}
}
pub(crate) fn incidences_after_delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn incidences_after_delete_vertex<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
G::Edge: Debug,
@@ -429,7 +429,7 @@ where
}
}
pub(crate) fn incidences_after_delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn incidences_after_delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
G::Edge: Debug,
@@ -446,7 +446,7 @@ where
}
}
pub(crate) fn incidence_cursor_after_delete_vertex<
pub fn incidence_cursor_after_delete_vertex<
G: GraphTopologyDeletion + GraphTopologyAddition,
>()
where
@@ -465,7 +465,7 @@ where
}
}
pub(crate) fn incidence_cursor_after_delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>()
pub fn incidence_cursor_after_delete_edge<G: GraphTopologyDeletion + GraphTopologyAddition>()
where
G::Vertex: Debug,
G::Edge: Debug,
@@ -540,3 +540,4 @@ fn assert_vertex_incidence_cursor<G: GraphTopology>(
v
);
}