1.1 --- a/src/lemon/concept/path.h	Mon Apr 18 14:18:12 2005 +0000
     1.2 +++ b/src/lemon/concept/path.h	Mon Apr 18 14:59:24 2005 +0000
     1.3 @@ -54,7 +54,7 @@
     1.4  
     1.5        /// \param _G The graph in which the path is.
     1.6        ///
     1.7 -      Path(const Graph &_G) {}
     1.8 +      Path(const Graph &) {}
     1.9  
    1.10        /// Length of the path.
    1.11        int length() const {return 0;}
    1.12 @@ -86,13 +86,13 @@
    1.13        ///
    1.14        /// Returns node iterator pointing to the target node of the
    1.15        /// given edge iterator.
    1.16 -      NodeIt target(const EdgeIt& e) const {return INVALID;}
    1.17 +      NodeIt target(const EdgeIt&) const {return INVALID;}
    1.18  
    1.19        /// \brief The source of an edge.
    1.20        ///
    1.21        /// Returns node iterator pointing to the source node of the
    1.22        /// given edge iterator.
    1.23 -      NodeIt source(const EdgeIt& e) const {return INVALID;}
    1.24 +      NodeIt source(const EdgeIt&) const {return INVALID;}
    1.25  
    1.26  
    1.27        /* Iterator classes */
    1.28 @@ -112,7 +112,7 @@
    1.29  	/// Invalid constructor
    1.30  	EdgeIt(Invalid) {}
    1.31  	/// Constructor with starting point
    1.32 -	EdgeIt(const Path &_p) {}
    1.33 +	EdgeIt(const Path &) {}
    1.34  
    1.35  	operator GraphEdge () const {}
    1.36  
    1.37 @@ -120,9 +120,9 @@
    1.38  	EdgeIt& operator++() {return *this;}
    1.39  
    1.40  	/// Comparison operator
    1.41 -	bool operator==(const EdgeIt& e) const {return true;}
    1.42 +	bool operator==(const EdgeIt&) const {return true;}
    1.43  	/// Comparison operator
    1.44 -	bool operator!=(const EdgeIt& e) const {return true;}
    1.45 +	bool operator!=(const EdgeIt&) const {return true;}
    1.46  // 	/// Comparison operator
    1.47  //      /// \todo It is not clear what is the "natural" ordering.
    1.48  // 	bool operator<(const EdgeIt& e) const {}
    1.49 @@ -144,7 +144,7 @@
    1.50  	/// Invalid constructor
    1.51  	NodeIt(Invalid) {}
    1.52  	/// Constructor with starting point
    1.53 -	NodeIt(const Path &_p) {}
    1.54 +	NodeIt(const Path &) {}
    1.55  
    1.56  	///Conversion to Graph::Node
    1.57  	operator const GraphNode& () const {}
    1.58 @@ -152,9 +152,9 @@
    1.59  	NodeIt& operator++() {return *this;}
    1.60  
    1.61  	/// Comparison operator
    1.62 -	bool operator==(const NodeIt& e) const {return true;}
    1.63 +	bool operator==(const NodeIt&) const {return true;}
    1.64  	/// Comparison operator
    1.65 -	bool operator!=(const NodeIt& e) const {return true;}
    1.66 +	bool operator!=(const NodeIt&) const {return true;}
    1.67  // 	/// Comparison operator
    1.68  //      /// \todo It is not clear what is the "natural" ordering.
    1.69  // 	bool operator<(const NodeIt& e) const {}
    1.70 @@ -201,14 +201,14 @@
    1.71  	///Push a new edge to the front of the path.
    1.72  	///If the path is empty, you \em must call \ref setStartNode() before
    1.73  	///the first use of \ref pushFront().
    1.74 -	void pushFront(const GraphEdge& e) {}
    1.75 +	void pushFront(const GraphEdge&) {}
    1.76  
    1.77  	///Push a new edge to the back of the path
    1.78  
    1.79  	///Push a new edge to the back of the path.
    1.80  	///If the path is empty, you \em must call \ref setStartNode() before
    1.81  	///the first use of \ref pushBack().
    1.82 -	void pushBack(const GraphEdge& e) {}
    1.83 +	void pushBack(const GraphEdge&) {}
    1.84  
    1.85  	///Commit the changes to the path.
    1.86  	void commit() {}
    1.87 @@ -218,13 +218,13 @@
    1.88  	///If you know a reasonable upper bound on the number of the edges
    1.89  	///to add to the front of the path,
    1.90  	///using this function you may speed up the building.
    1.91 -	void reserveFront(size_t r) {}
    1.92 +	void reserveFront(size_t) {}
    1.93  	///Reserve (back) storage for the builder in advance.
    1.94  
    1.95  	///If you know a reasonable upper bound on the number of the edges
    1.96  	///to add to the back of the path,
    1.97  	///using this function you may speed up the building.
    1.98 -	void reserveBack(size_t r) {}
    1.99 +	void reserveBack(size_t) {}
   1.100        };
   1.101      };
   1.102