1.1 --- a/lemon/lp_base.h	Fri Nov 04 15:00:19 2005 +0000
     1.2 +++ b/lemon/lp_base.h	Fri Nov 04 15:48:06 2005 +0000
     1.3 @@ -303,7 +303,6 @@
     1.4        Expr &operator+=(const Expr &e) {
     1.5  	for (Base::const_iterator j=e.begin(); j!=e.end(); ++j)
     1.6  	  (*this)[j->first]+=j->second;
     1.7 -	///\todo it might be speeded up using "hints"
     1.8  	const_comp+=e.const_comp;
     1.9  	return *this;
    1.10        }
    1.11 @@ -509,7 +508,6 @@
    1.12        DualExpr &operator+=(const DualExpr &e) {
    1.13  	for (Base::const_iterator j=e.begin(); j!=e.end(); ++j)
    1.14  	  (*this)[j->first]+=j->second;
    1.15 -	///\todo it might be speeded up using "hints"
    1.16  	return *this;
    1.17        }
    1.18        ///\e
    1.19 @@ -1001,7 +999,7 @@
    1.20  				      const LpSolverBase::Expr &b) 
    1.21    {
    1.22      LpSolverBase::Expr tmp(a);
    1.23 -    tmp+=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.24 +    tmp+=b;
    1.25      return tmp;
    1.26    }
    1.27    ///\e
    1.28 @@ -1012,7 +1010,7 @@
    1.29  				      const LpSolverBase::Expr &b) 
    1.30    {
    1.31      LpSolverBase::Expr tmp(a);
    1.32 -    tmp-=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.33 +    tmp-=b;
    1.34      return tmp;
    1.35    }
    1.36    ///\e
    1.37 @@ -1023,7 +1021,7 @@
    1.38  				      const LpSolverBase::Value &b) 
    1.39    {
    1.40      LpSolverBase::Expr tmp(a);
    1.41 -    tmp*=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.42 +    tmp*=b;
    1.43      return tmp;
    1.44    }
    1.45    
    1.46 @@ -1035,7 +1033,7 @@
    1.47  				      const LpSolverBase::Expr &b) 
    1.48    {
    1.49      LpSolverBase::Expr tmp(b);
    1.50 -    tmp*=a; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.51 +    tmp*=a;
    1.52      return tmp;
    1.53    }
    1.54    ///\e
    1.55 @@ -1046,7 +1044,7 @@
    1.56  				      const LpSolverBase::Value &b) 
    1.57    {
    1.58      LpSolverBase::Expr tmp(a);
    1.59 -    tmp/=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.60 +    tmp/=b;
    1.61      return tmp;
    1.62    }
    1.63    
    1.64 @@ -1184,7 +1182,7 @@
    1.65  				      const LpSolverBase::DualExpr &b) 
    1.66    {
    1.67      LpSolverBase::DualExpr tmp(a);
    1.68 -    tmp+=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.69 +    tmp+=b;
    1.70      return tmp;
    1.71    }
    1.72    ///\e
    1.73 @@ -1195,7 +1193,7 @@
    1.74  				      const LpSolverBase::DualExpr &b) 
    1.75    {
    1.76      LpSolverBase::DualExpr tmp(a);
    1.77 -    tmp-=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.78 +    tmp-=b;
    1.79      return tmp;
    1.80    }
    1.81    ///\e
    1.82 @@ -1206,7 +1204,7 @@
    1.83  				      const LpSolverBase::Value &b) 
    1.84    {
    1.85      LpSolverBase::DualExpr tmp(a);
    1.86 -    tmp*=b; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.87 +    tmp*=b;
    1.88      return tmp;
    1.89    }
    1.90    
    1.91 @@ -1218,7 +1216,7 @@
    1.92  				      const LpSolverBase::DualExpr &b) 
    1.93    {
    1.94      LpSolverBase::DualExpr tmp(b);
    1.95 -    tmp*=a; ///\todo Doesn't STL have some special 'merge' algorithm?
    1.96 +    tmp*=a;
    1.97      return tmp;
    1.98    }
    1.99    ///\e
   1.100 @@ -1229,7 +1227,7 @@
   1.101  				      const LpSolverBase::Value &b) 
   1.102    {
   1.103      LpSolverBase::DualExpr tmp(a);
   1.104 -    tmp/=b; ///\todo Doesn't STL have some special 'merge' algorithm?
   1.105 +    tmp/=b;
   1.106      return tmp;
   1.107    }
   1.108