[Boost-commit] svn:boost r51086 - trunk/boost/graph

Subject: [Boost-commit] svn:boost r51086 - trunk/boost/graph
From: asutton_at_[hidden]
Date: 2009-02-08 08:23:09

Author: asutton
Date: 2009-02-08 08:23:09 EST (Sun, 08 Feb 2009)
New Revision: 51086
URL: http://svn.boost.org/trac/boost/changeset/51086

Log:
Whitespace cleanup
Text files modified: 
   trunk/boost/graph/adjacency_list.hpp |    52 ++++++++++++++++++++--------------------
   1 files changed, 26 insertions(+), 26 deletions(-)

Modified: trunk/boost/graph/adjacency_list.hpp
==============================================================================
--- trunk/boost/graph/adjacency_list.hpp	(original)
+++ trunk/boost/graph/adjacency_list.hpp	2009-02-08 08:23:09 EST (Sun, 08 Feb 2009)
@@ -63,7 +63,7 @@
 #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #if !defined BOOST_NO_SLIST
-  struct slistS {};
+  struct slistS {};  
 #endif
 
   struct vecS  { };
@@ -135,35 +135,35 @@
     struct bind_ { typedef std::vector<T> type; };
   };
 
-  struct listS {
+  struct listS { 
     template <class T>
     struct bind_ { typedef std::list<T> type; };
   };
 
-  struct setS  {
+  struct setS  { 
     template <class T>
     struct bind_ { typedef std::set<T, std::less<T> > type; };
   };
 
-  struct multisetS  {
+  struct multisetS  { 
     template <class T>
     struct bind_ { typedef std::multiset<T, std::less<T> > type; };
   };
 
 #if !defined BOOST_NO_HASH
-  struct hash_setS {
+  struct hash_setS { 
     template <class T>
     struct bind_ { typedef BOOST_STD_EXTENSION_NAMESPACE::hash_set<T, std::less<T> > type; };
   };
 #endif
 
-  struct mapS  {
+  struct mapS  { 
     template <class T>
     struct bind_ { typedef std::set<T, std::less<T> > type; };
   };
 
 #if !defined BOOST_NO_HASH
-  struct hash_mapS {
+  struct hash_mapS { 
     template <class T>
     struct bind_ { typedef BOOST_STD_EXTENSION_NAMESPACE::hash_set<T, std::less<T> > type; };
   };
@@ -202,54 +202,54 @@
   struct parallel_edge_traits { };
 
   template <>
-  struct parallel_edge_traits<vecS> {
+  struct parallel_edge_traits<vecS> { 
     typedef allow_parallel_edge_tag type; };
 
   template <>
-  struct parallel_edge_traits<listS> {
+  struct parallel_edge_traits<listS> { 
     typedef allow_parallel_edge_tag type; };
 
 #if !defined BOOST_NO_SLIST
   template <>
-  struct parallel_edge_traits<slistS> {
+  struct parallel_edge_traits<slistS> { 
     typedef allow_parallel_edge_tag type; };
 #endif
 
   template <>
-  struct parallel_edge_traits<setS> {
+  struct parallel_edge_traits<setS> { 
     typedef disallow_parallel_edge_tag type; };
 
   template <>
-  struct parallel_edge_traits<multisetS> {
+  struct parallel_edge_traits<multisetS> { 
     typedef allow_parallel_edge_tag type; };
 
 #if !defined BOOST_NO_HASH
   template <>
   struct parallel_edge_traits<hash_setS> {
-    typedef disallow_parallel_edge_tag type;
+    typedef disallow_parallel_edge_tag type; 
   };
 #endif
 
   // mapS is obsolete, replaced with setS
   template <>
-  struct parallel_edge_traits<mapS> {
+  struct parallel_edge_traits<mapS> { 
     typedef disallow_parallel_edge_tag type; };
 
 #if !defined BOOST_NO_HASH
   template <>
   struct parallel_edge_traits<hash_mapS> {
-    typedef disallow_parallel_edge_tag type;
+    typedef disallow_parallel_edge_tag type; 
   };
 #endif
 
   namespace detail {
-    template <class Directed> struct is_random_access {
+    template <class Directed> struct is_random_access { 
       enum { value = false};
       typedef mpl::false_ type;
     };
     template <>
-    struct is_random_access<vecS> {
-      enum { value = true };
+    struct is_random_access<vecS> { 
+      enum { value = true }; 
       typedef mpl::true_ type;
     };
 
@@ -299,7 +299,7 @@
     typedef typename container_gen<EdgeListS, dummy>::type EdgeContainer;
     typedef typename DirectedS::is_bidir_t BidirectionalT;
     typedef typename DirectedS::is_directed_t DirectedT;
-    typedef typename mpl::and_<DirectedT,
+    typedef typename mpl::and_<DirectedT, 
       typename mpl::not_<BidirectionalT>::type >::type on_edge_storage;
   public:
     typedef typename mpl::if_<on_edge_storage,
@@ -329,7 +329,7 @@
     : public detail::adj_list_gen<
       adjacency_list<OutEdgeListS,VertexListS,DirectedS,
                      VertexProperty,EdgeProperty,GraphProperty,EdgeListS>,
-      VertexListS, OutEdgeListS, DirectedS,
+      VertexListS, OutEdgeListS, DirectedS, 
 #if !defined(BOOST_GRAPH_NO_BUNDLED_PROPERTIES)
       typename detail::retag_property_list<vertex_bundle_t,
                                            VertexProperty>::type,
@@ -382,7 +382,7 @@
   private:
     typedef adjacency_list self;
     typedef typename detail::adj_list_gen<
-      self, VertexListS, OutEdgeListS, DirectedS,
+      self, VertexListS, OutEdgeListS, DirectedS, 
       vertex_property_type, edge_property_type, GraphProperty, EdgeListS
     >::type Base;
 
@@ -400,7 +400,7 @@
 
     typedef GraphProperty graph_property_type;
 
-    inline adjacency_list(const GraphProperty& p = GraphProperty())
+    inline adjacency_list(const GraphProperty& p = GraphProperty()) 
       : m_property(p) { }
 
     inline adjacency_list(const adjacency_list& x)
@@ -416,7 +416,7 @@
     }
 
     // Required by Mutable Graph
-    inline adjacency_list(vertices_size_type num_vertices,
+    inline adjacency_list(vertices_size_type num_vertices, 
                           const GraphProperty& p = GraphProperty())
       : Base(num_vertices), m_property(p) { }
 
@@ -532,12 +532,12 @@
   get(T Bundle::* p, adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
                                     GraphProperty, EdgeListS>& g)
   {
-    typedef typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty,
+    typedef typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, 
                                                  EdgeProperty, GraphProperty, EdgeListS>, T Bundle::*>::type
       result_type;
     return result_type(&g, p);
   }
-
+  
   template<typename OutEdgeListS, typename VertexListS, typename DirectedS, typename VertexProperty,
            typename EdgeProperty, typename GraphProperty, typename EdgeListS, typename T, typename Bundle>
   inline
@@ -546,7 +546,7 @@
   get(T Bundle::* p, adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
                                     GraphProperty, EdgeListS> const & g)
   {
-    typedef typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty,
+    typedef typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, 
                                                  EdgeProperty, GraphProperty, EdgeListS>, T Bundle::*>::const_type
       result_type;
     return result_type(&g, p);