COIN-OR::LEMON - Graph Library

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


Ignore:
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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/concept/path.h

    r1359 r1367  
    5555      /// \param _G The graph in which the path is.
    5656      ///
    57       Path(const Graph &_G) {}
     57      Path(const Graph &) {}
    5858
    5959      /// Length of the path.
     
    8787      /// Returns node iterator pointing to the target node of the
    8888      /// given edge iterator.
    89       NodeIt target(const EdgeIt& e) const {return INVALID;}
     89      NodeIt target(const EdgeIt&) const {return INVALID;}
    9090
    9191      /// \brief The source of an edge.
     
    9393      /// Returns node iterator pointing to the source node of the
    9494      /// given edge iterator.
    95       NodeIt source(const EdgeIt& e) const {return INVALID;}
     95      NodeIt source(const EdgeIt&) const {return INVALID;}
    9696
    9797
     
    113113        EdgeIt(Invalid) {}
    114114        /// Constructor with starting point
    115         EdgeIt(const Path &_p) {}
     115        EdgeIt(const Path &) {}
    116116
    117117        operator GraphEdge () const {}
     
    121121
    122122        /// Comparison operator
    123         bool operator==(const EdgeIt& e) const {return true;}
    124         /// Comparison operator
    125         bool operator!=(const EdgeIt& e) const {return true;}
     123        bool operator==(const EdgeIt&) const {return true;}
     124        /// Comparison operator
     125        bool operator!=(const EdgeIt&) const {return true;}
    126126//      /// Comparison operator
    127127//      /// \todo It is not clear what is the "natural" ordering.
     
    145145        NodeIt(Invalid) {}
    146146        /// Constructor with starting point
    147         NodeIt(const Path &_p) {}
     147        NodeIt(const Path &) {}
    148148
    149149        ///Conversion to Graph::Node
     
    153153
    154154        /// Comparison operator
    155         bool operator==(const NodeIt& e) const {return true;}
    156         /// Comparison operator
    157         bool operator!=(const NodeIt& e) const {return true;}
     155        bool operator==(const NodeIt&) const {return true;}
     156        /// Comparison operator
     157        bool operator!=(const NodeIt&) const {return true;}
    158158//      /// Comparison operator
    159159//      /// \todo It is not clear what is the "natural" ordering.
     
    202202        ///If the path is empty, you \em must call \ref setStartNode() before
    203203        ///the first use of \ref pushFront().
    204         void pushFront(const GraphEdge& e) {}
     204        void pushFront(const GraphEdge&) {}
    205205
    206206        ///Push a new edge to the back of the path
     
    209209        ///If the path is empty, you \em must call \ref setStartNode() before
    210210        ///the first use of \ref pushBack().
    211         void pushBack(const GraphEdge& e) {}
     211        void pushBack(const GraphEdge&) {}
    212212
    213213        ///Commit the changes to the path.
     
    219219        ///to add to the front of the path,
    220220        ///using this function you may speed up the building.
    221         void reserveFront(size_t r) {}
     221        void reserveFront(size_t) {}
    222222        ///Reserve (back) storage for the builder in advance.
    223223
     
    225225        ///to add to the back of the path,
    226226        ///using this function you may speed up the building.
    227         void reserveBack(size_t r) {}
     227        void reserveBack(size_t) {}
    228228      };
    229229    };
Note: See TracChangeset for help on using the changeset viewer.