]> git.proxmox.com Git - ceph.git/blobdiff - ceph/src/boost/libs/graph/test/reverse_graph_cc.cpp
update source to Ceph Pacific 16.2.2
[ceph.git] / ceph / src / boost / libs / graph / test / reverse_graph_cc.cpp
index 145eb306c33f6251df0ae2411b56b1b2daa95913..7965f25ccf400cd4094bde174e4b098ef46ab84b 100644 (file)
 #include <boost/concept/assert.hpp>
 #include <string>
 
-int main(int,char*[])
+int main(int, char*[])
 {
-  using namespace boost;
-  // Check const reverse_graph
-  {
-    typedef adjacency_list< vecS, vecS, bidirectionalS, 
-      property<vertex_color_t, int>,
-      property<edge_weight_t, int>,
-      property<graph_name_t, std::string>
-    > AdjList;
-    typedef reverse_graph<AdjList> Graph;
-    BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
-    BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph> ));
-    typedef graph_traits<Graph>::vertex_descriptor Vertex;
-    typedef graph_traits<Graph>::edge_descriptor Edge;
-    BOOST_CONCEPT_ASSERT(( ReadablePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
-    BOOST_CONCEPT_ASSERT(( ReadablePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
-    BOOST_CONCEPT_ASSERT(( ReadablePropertyGraphConcept<Graph, Edge, edge_underlying_t> ));
-    AdjList g;
-    Graph gr(g);
-    get_property(gr, graph_name_t());
-  }
-  // Check non-const reverse_graph
-  {
-    typedef adjacency_list< vecS, vecS, bidirectionalS, 
-      property<vertex_color_t, int>,
-      property<edge_weight_t, int>,
-      property<graph_name_t, std::string>
-    > AdjList;
-    typedef reverse_graph<AdjList,AdjList&> Graph;
-    BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
-    BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph> ));
-    typedef graph_traits<Graph>::vertex_descriptor Vertex;
-    typedef graph_traits<Graph>::edge_descriptor Edge;
-    BOOST_CONCEPT_ASSERT(( PropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
-    BOOST_CONCEPT_ASSERT(( PropertyGraphConcept<Graph, Edge, edge_weight_t> ));
-    BOOST_CONCEPT_ASSERT(( ReadablePropertyGraphConcept<Graph, Edge, edge_underlying_t> ));
-    AdjList g;
-    Graph gr(g);
-    get_property(gr, graph_name_t());
-    set_property(gr, graph_name_t(), "foo");
-  }
-  return 0;
+    using namespace boost;
+    // Check const reverse_graph
+    {
+        typedef adjacency_list< vecS, vecS, bidirectionalS,
+            property< vertex_color_t, int >, property< edge_weight_t, int >,
+            property< graph_name_t, std::string > >
+            AdjList;
+        typedef reverse_graph< AdjList > Graph;
+        BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >));
+        BOOST_CONCEPT_ASSERT((BidirectionalGraphConcept< Graph >));
+        typedef graph_traits< Graph >::vertex_descriptor Vertex;
+        typedef graph_traits< Graph >::edge_descriptor Edge;
+        BOOST_CONCEPT_ASSERT(
+            (ReadablePropertyGraphConcept< Graph, Vertex, vertex_color_t >));
+        BOOST_CONCEPT_ASSERT(
+            (ReadablePropertyGraphConcept< Graph, Edge, edge_weight_t >));
+        BOOST_CONCEPT_ASSERT(
+            (ReadablePropertyGraphConcept< Graph, Edge, edge_underlying_t >));
+        AdjList g;
+        Graph gr(g);
+        get_property(gr, graph_name_t());
+    }
+    // Check non-const reverse_graph
+    {
+        typedef adjacency_list< vecS, vecS, bidirectionalS,
+            property< vertex_color_t, int >, property< edge_weight_t, int >,
+            property< graph_name_t, std::string > >
+            AdjList;
+        typedef reverse_graph< AdjList, AdjList& > Graph;
+        BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >));
+        BOOST_CONCEPT_ASSERT((BidirectionalGraphConcept< Graph >));
+        typedef graph_traits< Graph >::vertex_descriptor Vertex;
+        typedef graph_traits< Graph >::edge_descriptor Edge;
+        BOOST_CONCEPT_ASSERT(
+            (PropertyGraphConcept< Graph, Vertex, vertex_color_t >));
+        BOOST_CONCEPT_ASSERT(
+            (PropertyGraphConcept< Graph, Edge, edge_weight_t >));
+        BOOST_CONCEPT_ASSERT(
+            (ReadablePropertyGraphConcept< Graph, Edge, edge_underlying_t >));
+        AdjList g;
+        Graph gr(g);
+        get_property(gr, graph_name_t());
+        set_property(gr, graph_name_t(), "foo");
+    }
+    return 0;
 }