update source to Ceph Pacific 16.2.2

[ceph.git] / ceph / src / boost / libs / graph / test / test_iteration.hpp

diff --git a/ceph/src/boost/libs/graph/test/test_iteration.hpp b/ceph/src/boost/libs/graph/test/test_iteration.hpp
index 7842dd39c63c83a82d5fb73b28809da02689f407..3d6cb7078e3f0ef86082eb54bd644bef932a1504 100644 (file)
--- a/ceph/src/boost/libs/graph/test/test_iteration.hpp
+++ b/ceph/src/boost/libs/graph/test/test_iteration.hpp
@@ -15,14 +15,14 @@
  * do not expose this interface.
  */
 //@{
-template <typename Graph>
-void test_vertex_list_graph(Graph const& g) {
+template < typename Graph > void test_vertex_list_graph(Graph const& g)
+{
     using namespace boost;
-    BOOST_CONCEPT_ASSERT((VertexListGraphConcept<Graph>));
+    BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >));
 
     std::cout << "...test_vertex_list_graph\n";
-    typedef typename graph_traits<Graph>::vertex_iterator Iterator;
-    typedef std::pair<Iterator, Iterator> Range;
+    typedef typename graph_traits< Graph >::vertex_iterator Iterator;
+    typedef std::pair< Iterator, Iterator > Range;
 
     Range rng = vertices(g);
     BOOST_ASSERT(num_vertices(g) == N);
@@ -36,14 +36,14 @@ void test_vertex_list_graph(Graph const& g) {
  * do not expose this interface.
  */
 //@{
-template <typename Graph>
-void test_edge_list_graph(Graph const& g) {
+template < typename Graph > void test_edge_list_graph(Graph const& g)
+{
     using namespace boost;
-    BOOST_CONCEPT_ASSERT((EdgeListGraphConcept<Graph>));
+    BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< Graph >));
 
     std::cout << "...test_edge_list_graph\n";
-    typedef typename graph_traits<Graph>::edge_iterator Iterator;
-    typedef std::pair<Iterator, Iterator> Range;
+    typedef typename graph_traits< Graph >::edge_iterator Iterator;
+    typedef std::pair< Iterator, Iterator > Range;
 
     Range rng = edges(g);
     BOOST_ASSERT(num_edges(g) == M);