1.1 --- a/lemon/lp_base.h Mon Feb 19 12:11:41 2007 +0000
1.2 +++ b/lemon/lp_base.h Mon Feb 19 18:21:28 2007 +0000
1.3 @@ -972,7 +972,7 @@
1.4 ///\param l is lower bound (-\ref INF means no bound)
1.5 ///\param e is a linear expression (see \ref Expr)
1.6 ///\param u is the upper bound (\ref INF means no bound)
1.7 - ///\bug This is a temportary function. The interface will change to
1.8 + ///\bug This is a temporary function. The interface will change to
1.9 ///a better one.
1.10 ///\todo Option to control whether a constraint with a single variable is
1.11 ///added or not.
1.12 @@ -1009,7 +1009,7 @@
1.13 ///\param e is a linear expression (see \ref Expr)
1.14 ///\param u is the upper bound (\ref INF means no bound)
1.15 ///\return The created row.
1.16 - ///\bug This is a temportary function. The interface will change to
1.17 + ///\bug This is a temporary function. The interface will change to
1.18 ///a better one.
1.19 Row addRow(Value l,const Expr &e, Value u) {
1.20 Row r=addRow();
1.21 @@ -1284,8 +1284,7 @@
1.22 ///Set the objective function
1.23
1.24 ///\param e is a linear expression of type \ref Expr.
1.25 - ///\bug Is should be called obj()
1.26 - void setObj(Expr e) {
1.27 + void obj(Expr e) {
1.28 _clearObj();
1.29 for (Expr::iterator i=e.begin(); i!=e.end(); ++i)
1.30 objCoeff((*i).first,(*i).second);
1.31 @@ -1313,10 +1312,10 @@
1.32 void min() { _setMin(); }
1.33
1.34 ///Query function: is this a maximization problem?
1.35 - bool is_max() const {return _isMax(); }
1.36 + bool isMax() const {return _isMax(); }
1.37
1.38 ///Query function: is this a minimization problem?
1.39 - bool is_min() const {return !is_max(); }
1.40 + bool isMin() const {return !isMax(); }
1.41
1.42 ///@}
1.43