Changeset 1367:a490662291b9 in lemon-0.x for src/lemon/concept/path.h

Timestamp:

04/18/05 16:59:24 (16 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1812

Message:

More steps toward gcc-3.4 compatibility

File:

• src/lemon/concept/path.h (modified) (11 diffs)

src/lemon/concept/path.h

@@ -55 +55 @@
       /// \param _G The graph in which the path is.
       ///
-      Path(const Graph &_G) {}
+      Path(const Graph &) {}
 
       /// Length of the path.
@@ -87 +87 @@
       /// Returns node iterator pointing to the target node of the
       /// given edge iterator.
-      NodeIt target(const EdgeIt& e) const {return INVALID;}
+      NodeIt target(const EdgeIt&) const {return INVALID;}
 
       /// \brief The source of an edge.
@@ -93 +93 @@
       /// Returns node iterator pointing to the source node of the
       /// given edge iterator.
-      NodeIt source(const EdgeIt& e) const {return INVALID;}
+      NodeIt source(const EdgeIt&) const {return INVALID;}
 
 
@@ -113 +113 @@
         EdgeIt(Invalid) {}
         /// Constructor with starting point
-        EdgeIt(const Path &_p) {}
+        EdgeIt(const Path &) {}
 
         operator GraphEdge () const {}
@@ -121 +121 @@
 
         /// Comparison operator
-        bool operator==(const EdgeIt& e) const {return true;}
-        /// Comparison operator
-        bool operator!=(const EdgeIt& e) const {return true;}
+        bool operator==(const EdgeIt&) const {return true;}
+        /// Comparison operator
+        bool operator!=(const EdgeIt&) const {return true;}
 //      /// Comparison operator
 //      /// \todo It is not clear what is the "natural" ordering.
@@ -145 +145 @@
         NodeIt(Invalid) {}
         /// Constructor with starting point
-        NodeIt(const Path &_p) {}
+        NodeIt(const Path &) {}
 
         ///Conversion to Graph::Node
@@ -153 +153 @@
 
         /// Comparison operator
-        bool operator==(const NodeIt& e) const {return true;}
-        /// Comparison operator
-        bool operator!=(const NodeIt& e) const {return true;}
+        bool operator==(const NodeIt&) const {return true;}
+        /// Comparison operator
+        bool operator!=(const NodeIt&) const {return true;}
 //      /// Comparison operator
 //      /// \todo It is not clear what is the "natural" ordering.
@@ -202 +202 @@
         ///If the path is empty, you \em must call \ref setStartNode() before
         ///the first use of \ref pushFront().
-        void pushFront(const GraphEdge& e) {}
+        void pushFront(const GraphEdge&) {}
 
         ///Push a new edge to the back of the path
@@ -209 +209 @@
         ///If the path is empty, you \em must call \ref setStartNode() before
         ///the first use of \ref pushBack().
-        void pushBack(const GraphEdge& e) {}
+        void pushBack(const GraphEdge&) {}
 
         ///Commit the changes to the path.
@@ -219 +219 @@
         ///to add to the front of the path,
         ///using this function you may speed up the building.
-        void reserveFront(size_t r) {}
+        void reserveFront(size_t) {}
         ///Reserve (back) storage for the builder in advance.
 
@@ -225 +225 @@
         ///to add to the back of the path,
         ///using this function you may speed up the building.
-        void reserveBack(size_t r) {}
+        void reserveBack(size_t) {}
       };
     };