update source to Ceph Pacific 16.2.2

[ceph.git] / ceph / src / boost / boost / graph / lookup_edge.hpp

diff --git a/ceph/src/boost/boost/graph/lookup_edge.hpp b/ceph/src/boost/boost/graph/lookup_edge.hpp
index f8ea89e22ae48592f7f5c5b42ebfa01ff40d71aa..7c46cd11069c67b58ef573e34b5418f4f422e1f8 100644 (file)
--- a/ceph/src/boost/boost/graph/lookup_edge.hpp
+++ b/ceph/src/boost/boost/graph/lookup_edge.hpp
@@ -18,32 +18,37 @@
 // lookup_edge: a function that acts like edge() but falls back to out_edges()
 // and a search when edge() is not provided.
 
-namespace boost {
-
-  template <typename Graph>
-  std::pair<typename boost::graph_traits<Graph>::edge_descriptor, bool>
-  lookup_edge(typename boost::graph_traits<Graph>::vertex_descriptor src,
-              typename boost::graph_traits<Graph>::vertex_descriptor tgt,
-              const Graph& g,
-              typename boost::enable_if<is_adjacency_matrix<Graph>, int>::type = 0) {
+namespace boost
+{
+
+template < typename Graph >
+std::pair< typename boost::graph_traits< Graph >::edge_descriptor, bool >
+lookup_edge(typename boost::graph_traits< Graph >::vertex_descriptor src,
+    typename boost::graph_traits< Graph >::vertex_descriptor tgt,
+    const Graph& g,
+    typename boost::enable_if< is_adjacency_matrix< Graph >, int >::type = 0)
+{
     return edge(src, tgt, g);
-  }
-
-  template <typename Graph>
-  std::pair<typename boost::graph_traits<Graph>::edge_descriptor, bool>
-  lookup_edge(typename boost::graph_traits<Graph>::vertex_descriptor src,
-              typename boost::graph_traits<Graph>::vertex_descriptor tgt,
-              const Graph& g,
-              typename boost::disable_if<is_adjacency_matrix<Graph>, int>::type = 0) {
-    typedef typename boost::graph_traits<Graph>::out_edge_iterator it;
-    typedef typename boost::graph_traits<Graph>::edge_descriptor edesc;
-    std::pair<it, it> oe = out_edges(src, g);
-    for (; oe.first != oe.second; ++oe.first) {
-      edesc e = *oe.first;
-      if (target(e, g) == tgt) return std::make_pair(e, true);
+}
+
+template < typename Graph >
+std::pair< typename boost::graph_traits< Graph >::edge_descriptor, bool >
+lookup_edge(typename boost::graph_traits< Graph >::vertex_descriptor src,
+    typename boost::graph_traits< Graph >::vertex_descriptor tgt,
+    const Graph& g,
+    typename boost::disable_if< is_adjacency_matrix< Graph >, int >::type = 0)
+{
+    typedef typename boost::graph_traits< Graph >::out_edge_iterator it;
+    typedef typename boost::graph_traits< Graph >::edge_descriptor edesc;
+    std::pair< it, it > oe = out_edges(src, g);
+    for (; oe.first != oe.second; ++oe.first)
+    {
+        edesc e = *oe.first;
+        if (target(e, g) == tgt)
+            return std::make_pair(e, true);
     }
     return std::make_pair(edesc(), false);
-  }
+}
 
 }