# HG changeset patch # User alpar # Date 1112601823 0 # Node ID 02a403c305b9634650539a465ec9b0792df8469d # Parent 2dec219d9ca2203dc0294375febb1917b8005704 - Modifications to compile with *both* gcc-3.3 and gcc-3.4 - Adjust further SolutionType diff -r 2dec219d9ca2 -r 02a403c305b9 src/work/athos/lp/Makefile --- a/src/work/athos/lp/Makefile Sun Apr 03 10:20:49 2005 +0000 +++ b/src/work/athos/lp/Makefile Mon Apr 04 08:03:43 2005 +0000 @@ -14,4 +14,4 @@ lin_expr.h lp_test: lp_test.o lp_base.o lp_solver_skeleton.o lp_glpk.o - g++ -o $@ $^ -lglpk \ No newline at end of file + $(CXX) -o $@ $^ -lglpk \ No newline at end of file diff -r 2dec219d9ca2 -r 02a403c305b9 src/work/athos/lp/lp_base.h --- a/src/work/athos/lp/lp_base.h Sun Apr 03 10:20:49 2005 +0000 +++ b/src/work/athos/lp/lp_base.h Mon Apr 04 08:03:43 2005 +0000 @@ -114,14 +114,22 @@ ///\e enum SolutionType { - ///\e + ///Feasible solution has'n been found (but may exist). + + ///\todo NOTFOUND might be a better name. + /// UNDEFINED = 0, - ///\e + ///The problem has no feasible solution INFEASIBLE = 1, - ///\e + ///Feasible solution found FEASIBLE = 2, - ///\e - OPTIMAL = 3 + ///Optimal solution exists and found + OPTIMAL = 3, + ///The cost function is unbounded + + ///\todo Give a feasible solution and an infinite ray (and the + ///corresponding bases) + INFINITE = 4 }; ///The floating point type used by the solver @@ -351,9 +359,15 @@ ///\e const Value &upperBound() const { return _ub; } ///\e - bool lowerBounded() const { return std::isfinite(_lb); } + bool lowerBounded() const { + using namespace std; + return isfinite(_lb); + } ///\e - bool upperBounded() const { return std::isfinite(_ub); } + bool upperBounded() const { + using namespace std; + return isfinite(_ub); + } }; diff -r 2dec219d9ca2 -r 02a403c305b9 src/work/athos/lp/lp_test.cc --- a/src/work/athos/lp/lp_test.cc Sun Apr 03 10:20:49 2005 +0000 +++ b/src/work/athos/lp/lp_test.cc Mon Apr 04 08:03:43 2005 +0000 @@ -139,7 +139,7 @@ typedef typename G::OutEdgeIt OutEdgeIt; typedef typename G::InEdgeIt InEdgeIt; - typename G::EdgeMap x(g); + typename G::template EdgeMap x(g); lp.addColSet(x); for(EdgeIt e(g);e!=INVALID;++e) {