[Lemon-commits] [lemon_svn] alpar: r2832 - hugo/trunk/lemon/concept

[Lemon SVN]

Author: alpar
Date: Wed Jul  5 18:59:45 2006
New Revision: 2832

Modified:
   hugo/trunk/lemon/concept/bpugraph.h
   hugo/trunk/lemon/concept/graph.h
   hugo/trunk/lemon/concept/ugraph.h

Log:
As we agreed, Node/Edge::operator<() is required by the concept

Modified: hugo/trunk/lemon/concept/bpugraph.h
==============================================================================
--- hugo/trunk/lemon/concept/bpugraph.h	(original)
+++ hugo/trunk/lemon/concept/bpugraph.h	Wed Jul  5 18:59:45 2006
@@ -118,8 +118,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Node) const { return false; }
 
       };
@@ -414,8 +412,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(UEdge) const { return false; }
       };
 
@@ -551,8 +547,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Edge) const { return false; }
 	
       }; 

Modified: hugo/trunk/lemon/concept/graph.h
==============================================================================
--- hugo/trunk/lemon/concept/graph.h	(original)
+++ hugo/trunk/lemon/concept/graph.h	Wed Jul  5 18:59:45 2006
@@ -123,8 +123,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Node) const { return false; }
 
       };
@@ -215,8 +213,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Edge) const { return false; }
       };
     

Modified: hugo/trunk/lemon/concept/ugraph.h
==============================================================================
--- hugo/trunk/lemon/concept/ugraph.h	(original)
+++ hugo/trunk/lemon/concept/ugraph.h	Wed Jul  5 18:59:45 2006
@@ -107,8 +107,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Node) const { return false; }
 
       };
@@ -199,8 +197,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(UEdge) const { return false; }
       };
 
@@ -337,8 +333,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Edge) const { return false; }
 	
       };