Change all graph tests to pub to avoid unused-warnings

src/testing/graph_topology_testing.rs

@@ -62,17 +62,17 @@ macro_rules! graph_topology_tests {
     };
 }
 
-pub(crate) fn vertex_count_empty<G: MakeTestGraph>() {
+pub fn vertex_count_empty<G: MakeTestGraph>() {
     let graph = G::empty();
     assert_eq!(graph.vertex_count(), 0, "unexpected vertex count");
 }
 
-pub(crate) fn vertex_count<G: MakeTestGraph>() {
+pub fn vertex_count<G: MakeTestGraph>() {
     let (graph, _, _, _) = G::standard();
     assert_eq!(graph.vertex_count(), 10, "unexpected vertex count");
 }
 
-pub(crate) fn vertex_map<G: MakeTestGraph>() {
+pub fn vertex_map<G: MakeTestGraph>() {
     let (graph, v) = G::single_vertex();
     let mut map = graph.vertex_map(27);
     assert_eq!(map[v], 27, "unexpected value from default map read");
@@ -80,17 +80,17 @@ pub(crate) fn vertex_map<G: MakeTestGraph>() {
     assert_eq!(map[v], 9, "unexpected value from map after write");
 }
 
-pub(crate) fn edge_count_empty<G: MakeTestGraph>() {
+pub fn edge_count_empty<G: MakeTestGraph>() {
     let graph = G::empty();
     assert_eq!(graph.edge_count(), 0, "unexpected edge count");
 }
 
-pub(crate) fn edge_count<G: MakeTestGraph>() {
+pub fn edge_count<G: MakeTestGraph>() {
     let (graph, _, _, _) = G::standard();
     assert_eq!(graph.edge_count(), 18, "unexpected edge count");
 }
 
-pub(crate) fn edge_map<G: MakeTestGraph>() {
+pub fn edge_map<G: MakeTestGraph>() {
     let (graph, _, e) = G::single_edge();
     let mut map = graph.edge_map(28);
     assert_eq!(map[e], 28, "unexpected value from default map read");
@@ -98,12 +98,12 @@ pub(crate) fn edge_map<G: MakeTestGraph>() {
     assert_eq!(map[e], 8, "unexpected value from map after write");
 }
 
-pub(crate) fn degree_zero<G: MakeTestGraph>() {
+pub fn degree_zero<G: MakeTestGraph>() {
     let (graph, v) = G::single_vertex();
     assert_eq!(graph.degree(v), 0, "unexpected non-zero degree");
 }
 
-pub(crate) fn degree<G: MakeTestGraph>()
+pub fn degree<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -119,7 +119,7 @@ where
     }
 }
 
-pub(crate) fn loop_edge<G: MakeTestGraph>() {
+pub fn loop_edge<G: MakeTestGraph>() {
     let (graph, v, _) = G::loop_edge();
     assert_eq!(graph.vertex_count(), 1, "unexpected vertex count");
     assert_eq!(graph.edge_count(), 1, "unexpected edge count");
@@ -130,7 +130,7 @@ pub(crate) fn loop_edge<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn multiple_edges<G: MakeTestGraph>()
+pub fn multiple_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -156,7 +156,7 @@ where
     );
 }
 
-pub(crate) fn are_adjacent_vertex_self<G: MakeTestGraph>() {
+pub fn are_adjacent_vertex_self<G: MakeTestGraph>() {
     let (graph, v) = G::single_vertex();
     assert!(
         !graph.are_adjacent(v, v),
@@ -164,7 +164,7 @@ pub(crate) fn are_adjacent_vertex_self<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn are_adjacent_single_edge<G: MakeTestGraph>() {
+pub fn are_adjacent_single_edge<G: MakeTestGraph>() {
     let (graph, vertices, _) = G::single_edge();
     assert!(
         graph.are_adjacent(vertices[0], vertices[1]),
@@ -176,7 +176,7 @@ pub(crate) fn are_adjacent_single_edge<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn are_adjacent<G: MakeTestGraph>()
+pub fn are_adjacent<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -221,7 +221,7 @@ where
     }
 }
 
-pub(crate) fn vertices_empty<G: MakeTestGraph>() {
+pub fn vertices_empty<G: MakeTestGraph>() {
     let graph = G::empty();
     assert_eq!(
         graph.vertices().count(),
@@ -230,7 +230,7 @@ pub(crate) fn vertices_empty<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn vertices<G: MakeTestGraph>()
+pub fn vertices<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -245,7 +245,7 @@ where
     }
 }
 
-pub(crate) fn adjacent_vertices_empty<G: MakeTestGraph>() {
+pub fn adjacent_vertices_empty<G: MakeTestGraph>() {
     let (graph, v) = G::single_vertex();
     assert_eq!(
         graph.adjacent_vertices(v).count(),
@@ -254,7 +254,7 @@ pub(crate) fn adjacent_vertices_empty<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn adjacent_vertices<G: MakeTestGraph>()
+pub fn adjacent_vertices<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -292,7 +292,7 @@ where
     );
 }
 
-pub(crate) fn adjacent_vertices_loop_edge<G: MakeTestGraph>()
+pub fn adjacent_vertices_loop_edge<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -311,7 +311,7 @@ where
     );
 }
 
-pub(crate) fn adjacent_vertices_multiple_edges<G: MakeTestGraph>()
+pub fn adjacent_vertices_multiple_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
 {
@@ -336,7 +336,7 @@ where
     }
 }
 
-pub(crate) fn incident_vertices_single_edge<G: MakeTestGraph>()
+pub fn incident_vertices_single_edge<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -349,7 +349,7 @@ where
     );
 }
 
-pub(crate) fn incident_vertices_loop_edge<G: MakeTestGraph>()
+pub fn incident_vertices_loop_edge<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -362,7 +362,7 @@ where
     );
 }
 
-pub(crate) fn incident_vertices_multiple_edges<G: MakeTestGraph>()
+pub fn incident_vertices_multiple_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -383,7 +383,7 @@ where
     );
 }
 
-pub(crate) fn incident_vertices<G: MakeTestGraph>()
+pub fn incident_vertices<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -398,7 +398,7 @@ where
     }
 }
 
-pub(crate) fn edges_empty<G: MakeTestGraph>() {
+pub fn edges_empty<G: MakeTestGraph>() {
     let graph = G::empty();
     assert_eq!(
         graph.edges().count(),
@@ -407,7 +407,7 @@ pub(crate) fn edges_empty<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn edges<G: MakeTestGraph>()
+pub fn edges<G: MakeTestGraph>()
 where
     G::Edge: Debug,
 {
@@ -422,7 +422,7 @@ where
     }
 }
 
-pub(crate) fn incident_edges_empty<G: MakeTestGraph>() {
+pub fn incident_edges_empty<G: MakeTestGraph>() {
     let (graph, v) = G::single_vertex();
     assert_eq!(
         graph.incident_edges(v).count(),
@@ -431,7 +431,7 @@ pub(crate) fn incident_edges_empty<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn incident_edges<G: MakeTestGraph>()
+pub fn incident_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -461,7 +461,7 @@ where
     }
 }
 
-pub(crate) fn incident_edges_loop_edge<G: MakeTestGraph>()
+pub fn incident_edges_loop_edge<G: MakeTestGraph>()
 where
     G::Edge: Debug,
 {
@@ -480,7 +480,7 @@ where
     assert_eq!(iter.next(), None, "too many incident edges from iterator");
 }
 
-pub(crate) fn incident_edges_multiple_edges<G: MakeTestGraph>()
+pub fn incident_edges_multiple_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -505,7 +505,7 @@ where
     }
 }
 
-pub(crate) fn incidences_empty<G: MakeTestGraph>() {
+pub fn incidences_empty<G: MakeTestGraph>() {
     let (graph, v) = G::single_vertex();
     assert_eq!(
         graph.incidences(v).count(),
@@ -514,7 +514,7 @@ pub(crate) fn incidences_empty<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn incidences<G: MakeTestGraph>()
+pub fn incidences<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -547,7 +547,7 @@ where
     }
 }
 
-pub(crate) fn incidences_edge_consistency<G: MakeTestGraph>()
+pub fn incidences_edge_consistency<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -580,7 +580,7 @@ where
     }
 }
 
-pub(crate) fn incidences_loop_edge<G: MakeTestGraph>()
+pub fn incidences_loop_edge<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -604,7 +604,7 @@ where
     );
 }
 
-pub(crate) fn incidences_multiple_edges<G: MakeTestGraph>()
+pub fn incidences_multiple_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -641,7 +641,7 @@ where
     }
 }
 
-pub(crate) fn incidence_cursor_empty<G: MakeTestGraph>()
+pub fn incidence_cursor_empty<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -655,7 +655,7 @@ where
     );
 }
 
-pub(crate) fn incidence_cursor<G: MakeTestGraph>()
+pub fn incidence_cursor<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -683,7 +683,7 @@ where
     }
 }
 
-pub(crate) fn incidence_cursor_loop_edge<G: MakeTestGraph>()
+pub fn incidence_cursor_loop_edge<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -703,7 +703,7 @@ where
     assert_eq!(cursor.next(&graph), None, "too many incidences from cursor");
 }
 
-pub(crate) fn incidence_cursor_multiple_edges<G: MakeTestGraph>()
+pub fn incidence_cursor_multiple_edges<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -740,7 +740,7 @@ where
     }
 }
 
-pub(crate) fn incidence_cursor_copy<G: MakeTestGraph>() {
+pub fn incidence_cursor_copy<G: MakeTestGraph>() {
     let (graph, vertices, _) = G::two_edge_path();
     let mut c1 = graph.incidence_cursor(vertices[1]);
     assert!(c1.next(&graph).is_some(), "expected first incidence");
@@ -763,7 +763,7 @@ pub(crate) fn incidence_cursor_copy<G: MakeTestGraph>() {
     );
 }
 
-pub(crate) fn incident_vertices_incidences_consistency<G: MakeTestGraph>()
+pub fn incident_vertices_incidences_consistency<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -783,7 +783,7 @@ where
     }
 }
 
-pub(crate) fn incident_edges_incidences_consistency<G: MakeTestGraph>()
+pub fn incident_edges_incidences_consistency<G: MakeTestGraph>()
 where
     G::Vertex: Debug,
     G::Edge: Debug,
@@ -804,3 +804,4 @@ where
         );
     }
 }
+