update source to Ceph Pacific 16.2.2

[ceph.git] / ceph / src / boost / libs / graph / test / find_flow_cost_bundled_properties_and_named_params_test.cpp

diff --git a/ceph/src/boost/libs/graph/test/find_flow_cost_bundled_properties_and_named_params_test.cpp b/ceph/src/boost/libs/graph/test/find_flow_cost_bundled_properties_and_named_params_test.cpp
index efc7620664c72d49909ec442f2adba171a4ba738..d21f5470c37be4d191ee5cdffc09f956977e6382 100644 (file)
--- a/ceph/src/boost/libs/graph/test/find_flow_cost_bundled_properties_and_named_params_test.cpp
+++ b/ceph/src/boost/libs/graph/test/find_flow_cost_bundled_properties_and_named_params_test.cpp
@@ -1,79 +1,103 @@
-#define BOOST_TEST_MODULE find_flow_cost_bundled_properties_and_named_params_test
+#define BOOST_TEST_MODULE \
+    find_flow_cost_bundled_properties_and_named_params_test
 
 #include <boost/test/unit_test.hpp>
 #include <boost/graph/successive_shortest_path_nonnegative_weights.hpp>
 #include <boost/graph/find_flow_cost.hpp>
 #include "min_cost_max_flow_utils.hpp"
 
-typedef boost::adjacency_list_traits<boost::vecS,boost::vecS,boost::directedS> traits;
-struct edge_t {
-  double capacity;
-  float cost;
-  float residual_capacity;
-  traits::edge_descriptor reversed_edge;
+typedef boost::adjacency_list_traits< boost::vecS, boost::vecS,
+    boost::directedS >
+    traits;
+struct edge_t
+{
+    double capacity;
+    float cost;
+    float residual_capacity;
+    traits::edge_descriptor reversed_edge;
 };
-struct node_t {
-  traits::edge_descriptor predecessor;
-  int dist;
-  int dist_prev;
-  boost::vertex_index_t id;
+struct node_t
+{
+    traits::edge_descriptor predecessor;
+    int dist;
+    int dist_prev;
+    boost::vertex_index_t id;
 };
-typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph;
+typedef boost::adjacency_list< boost::listS, boost::vecS, boost::directedS,
+    node_t, edge_t >
+    Graph;
 
 // Unit test written in order to fails (at compile time) if the find_flow_cost()
 // is not properly handling bundled properties
 BOOST_AUTO_TEST_CASE(using_bundled_properties_with_find_max_flow_test)
 {
-  Graph g;
-  traits::vertex_descriptor s,t;
-
-  boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g);
-  boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g);
-  boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capacity, g);
-  boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_edge, g);
-  boost::property_map<Graph,traits::edge_descriptor node_t::* >::type pred = get(&node_t::predecessor, g);
-  boost::property_map<Graph,boost::vertex_index_t>::type vertex_indices = get(boost::vertex_index, g);
-  boost::property_map<Graph,int node_t::* >::type dist = get(&node_t::dist, g);
-  boost::property_map<Graph,int node_t::* >::type dist_prev = get(&node_t::dist_prev, g);
+    Graph g;
+    traits::vertex_descriptor s, t;
 
+    boost::property_map< Graph, double edge_t::* >::type capacity
+        = get(&edge_t::capacity, g);
+    boost::property_map< Graph, float edge_t::* >::type cost
+        = get(&edge_t::cost, g);
+    boost::property_map< Graph, float edge_t::* >::type residual_capacity
+        = get(&edge_t::residual_capacity, g);
+    boost::property_map< Graph, traits::edge_descriptor edge_t::* >::type rev
+        = get(&edge_t::reversed_edge, g);
+    boost::property_map< Graph, traits::edge_descriptor node_t::* >::type pred
+        = get(&node_t::predecessor, g);
+    boost::property_map< Graph, boost::vertex_index_t >::type vertex_indices
+        = get(boost::vertex_index, g);
+    boost::property_map< Graph, int node_t::* >::type dist
+        = get(&node_t::dist, g);
+    boost::property_map< Graph, int node_t::* >::type dist_prev
+        = get(&node_t::dist_prev, g);
 
-  boost::SampleGraph::getSampleGraph(g,s,t,capacity,residual_capacity,cost,rev);
+    boost::SampleGraph::getSampleGraph(
+        g, s, t, capacity, residual_capacity, cost, rev);
 
-  boost::successive_shortest_path_nonnegative_weights(g,s,t,
-      capacity,residual_capacity,cost,rev,vertex_indices,
-      pred,dist,dist_prev);
+    boost::successive_shortest_path_nonnegative_weights(g, s, t, capacity,
+        residual_capacity, cost, rev, vertex_indices, pred, dist, dist_prev);
 
-  // The "bundled properties" version (producing errors)
-  int flow_cost = boost::find_flow_cost(g,capacity,residual_capacity,cost);
-  BOOST_CHECK_EQUAL(flow_cost, 29);
+    // The "bundled properties" version (producing errors)
+    int flow_cost = boost::find_flow_cost(g, capacity, residual_capacity, cost);
+    BOOST_CHECK_EQUAL(flow_cost, 29);
 }
 
 // Unit test written in order to fails (at compile time) if the find_flow_cost()
 // is not properly handling bundled properties
-BOOST_AUTO_TEST_CASE(using_named_params_and_bundled_properties_with_find_max_flow_test)
+BOOST_AUTO_TEST_CASE(
+    using_named_params_and_bundled_properties_with_find_max_flow_test)
 {
-  Graph g;
-  traits::vertex_descriptor s,t;
+    Graph g;
+    traits::vertex_descriptor s, t;
 
-  boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g);
-  boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g);
-  boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capacity, g);
-  boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_edge, g);
-  boost::property_map<Graph,traits::edge_descriptor node_t::* >::type pred = get(&node_t::predecessor, g);
-  boost::property_map<Graph,boost::vertex_index_t>::type vertex_indices = get(boost::vertex_index, g);
-  boost::property_map<Graph,int node_t::* >::type dist = get(&node_t::dist, g);
-  boost::property_map<Graph,int node_t::* >::type dist_prev = get(&node_t::dist_prev, g);
+    boost::property_map< Graph, double edge_t::* >::type capacity
+        = get(&edge_t::capacity, g);
+    boost::property_map< Graph, float edge_t::* >::type cost
+        = get(&edge_t::cost, g);
+    boost::property_map< Graph, float edge_t::* >::type residual_capacity
+        = get(&edge_t::residual_capacity, g);
+    boost::property_map< Graph, traits::edge_descriptor edge_t::* >::type rev
+        = get(&edge_t::reversed_edge, g);
+    boost::property_map< Graph, traits::edge_descriptor node_t::* >::type pred
+        = get(&node_t::predecessor, g);
+    boost::property_map< Graph, boost::vertex_index_t >::type vertex_indices
+        = get(boost::vertex_index, g);
+    boost::property_map< Graph, int node_t::* >::type dist
+        = get(&node_t::dist, g);
+    boost::property_map< Graph, int node_t::* >::type dist_prev
+        = get(&node_t::dist_prev, g);
 
-  boost::SampleGraph::getSampleGraph(g,s,t,capacity,residual_capacity,cost,rev);
+    boost::SampleGraph::getSampleGraph(
+        g, s, t, capacity, residual_capacity, cost, rev);
 
-  boost::successive_shortest_path_nonnegative_weights(g,s,t,
-    capacity,residual_capacity,cost,rev,vertex_indices,
-    pred,dist,dist_prev);
+    boost::successive_shortest_path_nonnegative_weights(g, s, t, capacity,
+        residual_capacity, cost, rev, vertex_indices, pred, dist, dist_prev);
 
-  // The  "named parameters" version (with "bundled properties"; producing errors)
-  int flow_cost = boost::find_flow_cost(g,
-    boost::capacity_map(capacity)
-    .residual_capacity_map(residual_capacity)
-    .weight_map(cost));
-  BOOST_CHECK_EQUAL(flow_cost, 29);
+    // The  "named parameters" version (with "bundled properties"; producing
+    // errors)
+    int flow_cost = boost::find_flow_cost(g,
+        boost::capacity_map(capacity)
+            .residual_capacity_map(residual_capacity)
+            .weight_map(cost));
+    BOOST_CHECK_EQUAL(flow_cost, 29);
 }