lemon-0.x: comparison lemon/concepts/path.h

equal deleted inserted replaced

-:158c142651c8
+:eef475899e29
 > {
 void constraints() {
 int l = p.length();
 int e = p.empty();
-typename _Path::RevIt id, ii(INVALID), i(p);
+typename _Path::RevEdgeIt id, ii(INVALID), i(p);
 ++i;
 typename _Graph::Edge ed = i;
 e = (i == ii);
 bool empty() const { return true;}
 /// \brief Forward or reverse dumping
 ///
 /// If the RevPathTag is defined and true then reverse dumping
-/// is provided in the path proxy. In this case instead of the
+/// is provided in the path dumper. In this case instead of the
-/// EdgeIt the RevIt iterator should be implemented in the
+/// EdgeIt the RevEdgeIt iterator should be implemented in the
-/// proxy.
+/// dumper.
 typedef False RevPathTag;
 /// \brief Lemon style iterator for path edges
 ///
 /// This class is used to iterate on the edges of the paths.
 /// \brief Lemon style iterator for path edges
 ///
 /// This class is used to iterate on the edges of the paths in
 /// reverse direction.
-class RevIt {
+class RevEdgeIt {
 public:
 	/// Default constructor
-	RevIt() {}
+	RevEdgeIt() {}
 	/// Invalid constructor
-	RevIt(Invalid) {}
+	RevEdgeIt(Invalid) {}
 	/// Constructor for first edge
-	RevIt(const PathDumper &) {}
+	RevEdgeIt(const PathDumper &) {}
 /// Conversion to Edge
 	operator Edge() const { return INVALID; }
 	/// Next edge
-	RevIt& operator++() {return *this;}
+	RevEdgeIt& operator++() {return *this;}
 	/// Comparison operator
-	bool operator==(const RevIt&) const {return true;}
+	bool operator==(const RevEdgeIt&) const {return true;}
 	/// Comparison operator
-	bool operator!=(const RevIt&) const {return true;}
+	bool operator!=(const RevEdgeIt&) const {return true;}
 	/// Comparison operator
-	bool operator<(const RevIt&) const {return false;}
+	bool operator<(const RevEdgeIt&) const {return false;}
 };
 template <typename _Path>
 struct Constraints {

changeset 2379	248152674a9e
parent 2335	27aa03cd3121
child 2391	14a343be7a5a