[Lemon-commits] [Lemon-1.0 commits] Peter Kovacs: Revert faulty changes of [dc9e...

[Lemon HG]

details:   http://lemon.cs.elte.hu/hg/lemon-1.0/rev/8c05947fc107
changeset: 304:8c05947fc107
user:      Peter Kovacs <kpeter [at] inf.elte.hu>
date:      Wed Oct 08 12:20:09 2008 +0200
description:
	Revert faulty changes of [dc9e8d2c0df9]

diffstat:

1 file changed, 8 insertions(+), 8 deletions(-)
lemon/core.h |   16 ++++++++--------

diffs (57 lines):

diff -r 907446600ca9 -r 8c05947fc107 lemon/core.h
--- a/lemon/core.h	Tue Oct 07 07:08:45 2008 +0100
+++ b/lemon/core.h	Wed Oct 08 12:20:09 2008 +0200
@@ -58,7 +58,7 @@
   /// \addtogroup gutils
   /// @{
 
-  ///Create convenient typedefs for the digraph types and iterators
+  ///Create convenience typedefs for the digraph types and iterators
 
   ///This \c \#define creates convenient type definitions for the following
   ///types of \c Digraph: \c Node,  \c NodeIt, \c Arc, \c ArcIt, \c InArcIt,
@@ -80,9 +80,9 @@
   typedef Digraph::NodeMap<double> DoubleNodeMap;                       \
   typedef Digraph::ArcMap<bool> BoolArcMap;                             \
   typedef Digraph::ArcMap<int> IntArcMap;                               \
-  typedef Digraph::ArcMap<double> DoubleArcMap;
+  typedef Digraph::ArcMap<double> DoubleArcMap
 
-  ///Create convenient typedefs for the digraph types and iterators
+  ///Create convenience typedefs for the digraph types and iterators
 
   ///\see DIGRAPH_TYPEDEFS
   ///
@@ -100,9 +100,9 @@
   typedef typename Digraph::template NodeMap<double> DoubleNodeMap;     \
   typedef typename Digraph::template ArcMap<bool> BoolArcMap;           \
   typedef typename Digraph::template ArcMap<int> IntArcMap;             \
-  typedef typename Digraph::template ArcMap<double> DoubleArcMap;
+  typedef typename Digraph::template ArcMap<double> DoubleArcMap
 
-  ///Create convenient typedefs for the graph types and iterators
+  ///Create convenience typedefs for the graph types and iterators
 
   ///This \c \#define creates the same convenient type definitions as defined
   ///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates
@@ -119,9 +119,9 @@
   typedef Graph::IncEdgeIt IncEdgeIt;                                   \
   typedef Graph::EdgeMap<bool> BoolEdgeMap;                             \
   typedef Graph::EdgeMap<int> IntEdgeMap;                               \
-  typedef Graph::EdgeMap<double> DoubleEdgeMap;
+  typedef Graph::EdgeMap<double> DoubleEdgeMap
 
-  ///Create convenient typedefs for the graph types and iterators
+  ///Create convenience typedefs for the graph types and iterators
 
   ///\see GRAPH_TYPEDEFS
   ///
@@ -134,7 +134,7 @@
   typedef typename Graph::IncEdgeIt IncEdgeIt;                          \
   typedef typename Graph::template EdgeMap<bool> BoolEdgeMap;           \
   typedef typename Graph::template EdgeMap<int> IntEdgeMap;             \
-  typedef typename Graph::template EdgeMap<double> DoubleEdgeMap;
+  typedef typename Graph::template EdgeMap<double> DoubleEdgeMap
 
   /// \brief Function to count the items in a graph.
   ///