songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Drive-by boost removal

This commit is contained in:
Mael Rouxel-Labbé 2022-10-04 15:36:34 +02:00
parent 226f84f2e6
commit 723e44389c
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
BGL/include/CGAL/boost/graph/internal/helpers.h
View File

@ -11,14 +11,15 @@
#ifndef CGAL_BOOST_GRAPH_INTERNAL_HELPERS_H
#define CGAL_BOOST_GRAPH_INTERNAL_HELPERS_H
#include <boost/graph/graph_traits.hpp>
#include <boost/optional.hpp>
#include <CGAL/iterator.h>
#include <CGAL/property_map.h>
#include <CGAL/boost/graph/iterator.h>
#include <CGAL/Named_function_parameters.h>
#include <boost/iterator/function_output_iterator.hpp>
#include <tuple>
namespace CGAL {
// breaks a dependency loop between <CGAL/boost/graph/helpers.h>
@ -133,7 +134,7 @@ std::size_t
exact_num_vertices(const Graph& g)
{
typename boost::graph_traits<Graph>::vertex_iterator beg, end;
boost::tie(beg,end) = vertices(g);
std::tie(beg,end) = vertices(g);
return std::distance(beg,end);
}
@ -142,7 +143,7 @@ std::size_t
exact_num_halfedges(const Graph& g)
{
typename boost::graph_traits<Graph>::halfedge_iterator beg, end;
boost::tie(beg,end) = halfedges(g);
std::tie(beg,end) = halfedges(g);
return std::distance(beg,end);
}
@ -151,7 +152,7 @@ std::size_t
exact_num_edges(const Graph& g)
{
typename boost::graph_traits<Graph>::edge_iterator beg, end;
boost::tie(beg,end) = edges(g);
std::tie(beg,end) = edges(g);
return std::distance(beg,end);
}
@ -160,7 +161,7 @@ std::size_t
exact_num_faces(const Graph& g)
{
typename boost::graph_traits<Graph>::face_iterator beg, end;
boost::tie(beg,end) = faces(g);
std::tie(beg,end) = faces(g);
return std::distance(beg,end);
}