From 8c5515bb423fc7e67130f4aed3890fb4902dcac8 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?= Date: Tue, 28 Jan 2025 21:05:27 +0100 Subject: [PATCH 1/2] Fix types --- BGL/doc/BGL/BGL.txt | 2 +- BGL/doc/BGL/Concepts/FaceListGraph.h | 2 +- BGL/doc/BGL/Concepts/HalfedgeListGraph.h | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/BGL/doc/BGL/BGL.txt b/BGL/doc/BGL/BGL.txt index cf7e8a73903..fc770bee398 100644 --- a/BGL/doc/BGL/BGL.txt +++ b/BGL/doc/BGL/BGL.txt @@ -88,7 +88,7 @@ boost::graph_traits::edge_iterator ei; Algorithms obtain incidence information in graphs with the help of global functions such as: - `std::pair vertices(const Graph& g);` to obtain an iterator range providing access to all the vertices, or -- `int num_vertices(const Graph&);` to obtain the number of vertices of a graph, or +- `size_type num_vertices(const Graph&);` to obtain the number of vertices of a graph, or - `vertex_descriptor source(edge_descriptor, const Graph&);` to obtain the source vertex of an edge. Note, that the way we have written the types is a simplification; in reality, diff --git a/BGL/doc/BGL/Concepts/FaceListGraph.h b/BGL/doc/BGL/Concepts/FaceListGraph.h index 6e7936f5ad9..b9075e2920f 100644 --- a/BGL/doc/BGL/Concepts/FaceListGraph.h +++ b/BGL/doc/BGL/Concepts/FaceListGraph.h @@ -38,6 +38,6 @@ faces(const FaceListGraph& g); This is the case for implementations only marking faces deleted in the face container. */ template -boost::graph_traits::face_size_type +boost::graph_traits::faces_size_type num_faces(const FaceListGraph& g); diff --git a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h index 1019f3c336b..4610c612bd4 100644 --- a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h +++ b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h @@ -38,6 +38,6 @@ halfedges(const HalfedgeListGraph& g); This is the case for implementations only marking halfedges deleted in the halfedge container. */ template -boost::graph_traits::halfedge_size_type +boost::graph_traits::halfedges_size_type num_halfedges(const HalfedgeListGraph& g); From 68e7bfa4aac6cd5236d68383e64490e8eb19ce1a Mon Sep 17 00:00:00 2001 From: Mael Date: Tue, 28 Jan 2025 21:07:58 +0100 Subject: [PATCH 2/2] Might as well use the real type --- BGL/doc/BGL/BGL.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/BGL/doc/BGL/BGL.txt b/BGL/doc/BGL/BGL.txt index fc770bee398..c256f4f30fa 100644 --- a/BGL/doc/BGL/BGL.txt +++ b/BGL/doc/BGL/BGL.txt @@ -88,7 +88,7 @@ boost::graph_traits::edge_iterator ei; Algorithms obtain incidence information in graphs with the help of global functions such as: - `std::pair vertices(const Graph& g);` to obtain an iterator range providing access to all the vertices, or -- `size_type num_vertices(const Graph&);` to obtain the number of vertices of a graph, or +- `vertices_size_type num_vertices(const Graph&);` to obtain the number of vertices of a graph, or - `vertex_descriptor source(edge_descriptor, const Graph&);` to obtain the source vertex of an edge. Note, that the way we have written the types is a simplification; in reality,