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

[Lemon SVN]

Author: alpar
Date: Fri Nov  4 16:48:06 2005
New Revision: 2298

Modified:
   hugo/trunk/lemon/lp_base.h

Log:
Tons of todos have been removed.


Modified: hugo/trunk/lemon/lp_base.h
==============================================================================
--- hugo/trunk/lemon/lp_base.h	(original)
+++ hugo/trunk/lemon/lp_base.h	Fri Nov  4 16:48:06 2005
@@ -303,7 +303,6 @@
       Expr &operator+=(const Expr &e) {
 	for (Base::const_iterator j=e.begin(); j!=e.end(); ++j)
 	  (*this)[j->first]+=j->second;
-	///\todo it might be speeded up using "hints"
 	const_comp+=e.const_comp;
 	return *this;
       }
@@ -509,7 +508,6 @@
       DualExpr &operator+=(const DualExpr &e) {
 	for (Base::const_iterator j=e.begin(); j!=e.end(); ++j)
 	  (*this)[j->first]+=j->second;
-	///\todo it might be speeded up using "hints"
 	return *this;
       }
       ///\e
@@ -1001,7 +999,7 @@
 				      const LpSolverBase::Expr &b) 
   {
     LpSolverBase::Expr tmp(a);
-    tmp+=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp+=b;
     return tmp;
   }
   ///\e
@@ -1012,7 +1010,7 @@
 				      const LpSolverBase::Expr &b) 
   {
     LpSolverBase::Expr tmp(a);
-    tmp-=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp-=b;
     return tmp;
   }
   ///\e
@@ -1023,7 +1021,7 @@
 				      const LpSolverBase::Value &b) 
   {
     LpSolverBase::Expr tmp(a);
-    tmp*=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp*=b;
     return tmp;
   }
   
@@ -1035,7 +1033,7 @@
 				      const LpSolverBase::Expr &b) 
   {
     LpSolverBase::Expr tmp(b);
-    tmp*=a; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp*=a;
     return tmp;
   }
   ///\e
@@ -1046,7 +1044,7 @@
 				      const LpSolverBase::Value &b) 
   {
     LpSolverBase::Expr tmp(a);
-    tmp/=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp/=b;
     return tmp;
   }
   
@@ -1184,7 +1182,7 @@
 				      const LpSolverBase::DualExpr &b) 
   {
     LpSolverBase::DualExpr tmp(a);
-    tmp+=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp+=b;
     return tmp;
   }
   ///\e
@@ -1195,7 +1193,7 @@
 				      const LpSolverBase::DualExpr &b) 
   {
     LpSolverBase::DualExpr tmp(a);
-    tmp-=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp-=b;
     return tmp;
   }
   ///\e
@@ -1206,7 +1204,7 @@
 				      const LpSolverBase::Value &b) 
   {
     LpSolverBase::DualExpr tmp(a);
-    tmp*=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp*=b;
     return tmp;
   }
   
@@ -1218,7 +1216,7 @@
 				      const LpSolverBase::DualExpr &b) 
   {
     LpSolverBase::DualExpr tmp(b);
-    tmp*=a; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp*=a;
     return tmp;
   }
   ///\e
@@ -1229,7 +1227,7 @@
 				      const LpSolverBase::Value &b) 
   {
     LpSolverBase::DualExpr tmp(a);
-    tmp/=b; ///\todo Doesn't STL have some special 'merge' algorithm?
+    tmp/=b;
     return tmp;
   }