update source to Ceph Pacific 16.2.2

[ceph.git] / ceph / src / boost / boost / graph / property_maps / container_property_map.hpp

diff --git a/ceph/src/boost/boost/graph/property_maps/container_property_map.hpp b/ceph/src/boost/boost/graph/property_maps/container_property_map.hpp
index e07cd3306532ff8cd5106786b80ab826219cf81a..6a565c2e9d4f833f5bd2c5155c737720ddde4ef4 100644 (file)
--- a/ceph/src/boost/boost/graph/property_maps/container_property_map.hpp
+++ b/ceph/src/boost/boost/graph/property_maps/container_property_map.hpp
@@ -12,64 +12,59 @@
 
 namespace boost
 {
-    // This is an adapter built over the iterator property map with
-    // more useful uniform construction semantics. Specifically, this
-    // requires the container rather than the iterator and the graph
-    // rather than the optional index map.
-    template <typename Graph, typename Key, typename Container>
-    struct container_property_map
-        : public boost::put_get_helper<
-                typename iterator_property_map<
-                        typename Container::iterator,
-                        typename property_map<
-                                Graph,
-                                typename detail::choose_indexer<Graph, Key>::index_type
-                            >::type
-                    >::reference,
-                    container_property_map<Graph, Key, Container>
-            >
-    {
-        typedef typename detail::choose_indexer<Graph, Key>::indexer_type indexer_type;
-        typedef typename indexer_type::index_type index_type;
-        typedef iterator_property_map<
-                typename Container::iterator,
-                typename property_map<Graph, index_type>::type
-            > map_type;
-        typedef typename map_type::key_type key_type;
-        typedef typename map_type::value_type value_type;
-        typedef typename map_type::reference reference;
-        typedef typename map_type::category category;
+// This is an adapter built over the iterator property map with
+// more useful uniform construction semantics. Specifically, this
+// requires the container rather than the iterator and the graph
+// rather than the optional index map.
+template < typename Graph, typename Key, typename Container >
+struct container_property_map
+: public boost::put_get_helper<
+      typename iterator_property_map< typename Container::iterator,
+          typename property_map< Graph,
+              typename detail::choose_indexer< Graph,
+                  Key >::index_type >::type >::reference,
+      container_property_map< Graph, Key, Container > >
+{
+    typedef typename detail::choose_indexer< Graph, Key >::indexer_type
+        indexer_type;
+    typedef typename indexer_type::index_type index_type;
+    typedef iterator_property_map< typename Container::iterator,
+        typename property_map< Graph, index_type >::type >
+        map_type;
+    typedef typename map_type::key_type key_type;
+    typedef typename map_type::value_type value_type;
+    typedef typename map_type::reference reference;
+    typedef typename map_type::category category;
 
-        // The default constructor will *probably* crash if its actually
-        // used for referencing vertices since the underlying iterator
-        // map points past the end of an unknown container.
-        inline container_property_map()
-            : m_map()
-        { }
+    // The default constructor will *probably* crash if its actually
+    // used for referencing vertices since the underlying iterator
+    // map points past the end of an unknown container.
+    inline container_property_map() : m_map() {}
 
-        // This is the preferred constructor. It is invoked over the container
-        // and the graph explicitly. This requires that the underlying iterator
-        // map use the indices of the vertices in g rather than the default
-        // identity map.
-        //
-        // Note the const-cast this ensures the reference type of the
-        // vertex index map is non-const, which happens to be an
-        // artifact of passing const graph references.
-        inline container_property_map(Container& c, const Graph& g)
-            : m_map(c.begin(), indexer_type::index_map(const_cast<Graph&>(g)))
-        { }
+    // This is the preferred constructor. It is invoked over the container
+    // and the graph explicitly. This requires that the underlying iterator
+    // map use the indices of the vertices in g rather than the default
+    // identity map.
+    //
+    // Note the const-cast this ensures the reference type of the
+    // vertex index map is non-const, which happens to be an
+    // artifact of passing const graph references.
+    inline container_property_map(Container& c, const Graph& g)
+    : m_map(c.begin(), indexer_type::index_map(const_cast< Graph& >(g)))
+    {
+    }
 
-        // Typical copy constructor.
-        inline container_property_map(const container_property_map& x)
-            : m_map(x.m_map)
-        { }
+    // Typical copy constructor.
+    inline container_property_map(const container_property_map& x)
+    : m_map(x.m_map)
+    {
+    }
 
-        // The [] operator delegates to the underlying map/
-        inline reference operator [](const key_type& k) const
-        { return m_map[k];  }
+    // The [] operator delegates to the underlying map/
+    inline reference operator[](const key_type& k) const { return m_map[k]; }
 
-        map_type m_map;
-    };
+    map_type m_map;
+};
 }
 
 #endif