[Lemon-commits] deba: r3376 - in lemon/trunk: benchmark demo lemon
Lemon SVN
svn at lemon.cs.elte.hu
Wed Nov 14 16:36:38 CET 2007
Author: deba
Date: Wed Nov 14 16:36:37 2007
New Revision: 3376
Modified:
lemon/trunk/benchmark/edge_lookup.cc
lemon/trunk/demo/graph_orientation.cc
lemon/trunk/demo/strongly_connected_orientation.cc
lemon/trunk/lemon/graph_utils.h
lemon/trunk/lemon/steiner.h
Log:
removing semicolon ftom the end of GRAPH_TYPEDEFS
Modified: lemon/trunk/benchmark/edge_lookup.cc
==============================================================================
--- lemon/trunk/benchmark/edge_lookup.cc (original)
+++ lemon/trunk/benchmark/edge_lookup.cc Wed Nov 14 16:36:37 2007
@@ -29,7 +29,7 @@
class EdgeLookUp2
{
public:
- GRAPH_TYPEDEFS(typename G)
+ GRAPH_TYPEDEFS(typename G);
typedef G Graph;
private:
@@ -107,7 +107,7 @@
class EdgeLookUp3
{
public:
- GRAPH_TYPEDEFS(typename G)
+ GRAPH_TYPEDEFS(typename G);
typedef G Graph;
private:
@@ -194,7 +194,7 @@
// class EdgeLookUp4
// {
// public:
-// GRAPH_TYPEDEFS(typename G)
+// GRAPH_TYPEDEFS(typename G);
// typedef G Graph;
// private:
@@ -287,7 +287,7 @@
// class EdgeLookUp5
// {
// public:
-// GRAPH_TYPEDEFS(typename G)
+// GRAPH_TYPEDEFS(typename G);
// typedef G Graph;
// private:
@@ -377,7 +377,7 @@
// };
-GRAPH_TYPEDEFS(SmartGraph)
+GRAPH_TYPEDEFS(SmartGraph);
typedef SmartGraph Graph;
class FE
Modified: lemon/trunk/demo/graph_orientation.cc
==============================================================================
--- lemon/trunk/demo/graph_orientation.cc (original)
+++ lemon/trunk/demo/graph_orientation.cc Wed Nov 14 16:36:37 2007
@@ -25,7 +25,7 @@
using namespace lemon;
-GRAPH_TYPEDEFS(ListGraph)
+GRAPH_TYPEDEFS(ListGraph);
int main(int argc, char** argv)
{
Modified: lemon/trunk/demo/strongly_connected_orientation.cc
==============================================================================
--- lemon/trunk/demo/strongly_connected_orientation.cc (original)
+++ lemon/trunk/demo/strongly_connected_orientation.cc Wed Nov 14 16:36:37 2007
@@ -42,7 +42,7 @@
using namespace std;
typedef SmartUGraph UGraph;
-UGRAPH_TYPEDEFS(UGraph)
+UGRAPH_TYPEDEFS(UGraph);
Color color(bool c) {
return c ? BLACK : RED;
Modified: lemon/trunk/lemon/graph_utils.h
==============================================================================
--- lemon/trunk/lemon/graph_utils.h (original)
+++ lemon/trunk/lemon/graph_utils.h Wed Nov 14 16:36:37 2007
@@ -49,7 +49,7 @@
///\c OutEdgeIt
///\note If \c G it a template parameter, it should be used in this way.
///\code
- /// GRAPH_TYPEDEFS(typename G)
+ /// GRAPH_TYPEDEFS(typename G);
///\endcode
///
///\warning There are no typedefs for the graph maps because of the lack of
@@ -60,7 +60,7 @@
typedef Graph:: Edge Edge; \
typedef Graph:: EdgeIt EdgeIt; \
typedef Graph:: InEdgeIt InEdgeIt; \
- typedef Graph::OutEdgeIt OutEdgeIt;
+ typedef Graph::OutEdgeIt OutEdgeIt
///Creates convenience typedefs for the undirected graph types and iterators
@@ -70,16 +70,16 @@
///
///\note If \c G it a template parameter, it should be used in this way.
///\code
- /// UGRAPH_TYPEDEFS(typename G)
+ /// UGRAPH_TYPEDEFS(typename G);
///\endcode
///
///\warning There are no typedefs for the graph maps because of the lack of
///template typedefs in C++.
#define UGRAPH_TYPEDEFS(Graph) \
- GRAPH_TYPEDEFS(Graph) \
+ GRAPH_TYPEDEFS(Graph); \
typedef Graph:: UEdge UEdge; \
typedef Graph:: UEdgeIt UEdgeIt; \
- typedef Graph:: IncEdgeIt IncEdgeIt;
+ typedef Graph:: IncEdgeIt IncEdgeIt
///\brief Creates convenience typedefs for the bipartite undirected graph
///types and iterators
@@ -90,17 +90,17 @@
///
///\note If \c G it a template parameter, it should be used in this way.
///\code
- /// BPUGRAPH_TYPEDEFS(typename G)
+ /// BPUGRAPH_TYPEDEFS(typename G);
///\endcode
///
///\warning There are no typedefs for the graph maps because of the lack of
///template typedefs in C++.
#define BPUGRAPH_TYPEDEFS(Graph) \
- UGRAPH_TYPEDEFS(Graph) \
+ UGRAPH_TYPEDEFS(Graph); \
typedef Graph::ANode ANode; \
typedef Graph::BNode BNode; \
typedef Graph::ANodeIt ANodeIt; \
- typedef Graph::BNodeIt BNodeIt;
+ typedef Graph::BNodeIt BNodeIt
/// \brief Function to count the items in the graph.
///
@@ -2492,7 +2492,7 @@
class EdgeLookUp
{
public:
- GRAPH_TYPEDEFS(typename G)
+ GRAPH_TYPEDEFS(typename G);
typedef G Graph;
protected:
@@ -2608,7 +2608,7 @@
using EdgeLookUp<G>::_left;
using EdgeLookUp<G>::_head;
- GRAPH_TYPEDEFS(typename G)
+ GRAPH_TYPEDEFS(typename G);
typedef G Graph;
typename Graph::template EdgeMap<Edge> _next;
Modified: lemon/trunk/lemon/steiner.h
==============================================================================
--- lemon/trunk/lemon/steiner.h (original)
+++ lemon/trunk/lemon/steiner.h Wed Nov 14 16:36:37 2007
@@ -55,7 +55,7 @@
class SteinerTree {
public:
- UGRAPH_TYPEDEFS(typename UGraph)
+ UGRAPH_TYPEDEFS(typename UGraph);
typedef typename CostMap::Value Value;
More information about the Lemon-commits
mailing list