0
13
0
2
2
5
3
10
8
10
21
29
21
24
1
... | ... |
@@ -58,2 +58,7 @@ |
58 | 58 |
|
59 |
/// \e |
|
60 |
virtual ClpLp* newSolver() const; |
|
61 |
/// \e |
|
62 |
virtual ClpLp* cloneSolver() const; |
|
63 |
|
|
59 | 64 |
protected: |
... | ... |
@@ -68,5 +73,2 @@ |
68 | 73 |
|
69 |
virtual ClpLp* _newSolver() const; |
|
70 |
virtual ClpLp* _cloneSolver() const; |
|
71 |
|
|
72 | 74 |
virtual const char* _solverName() const; |
... | ... |
@@ -453,4 +453,4 @@ |
453 | 453 |
|
454 |
CplexLp* CplexLp::_newSolver() const { return new CplexLp; } |
|
455 |
CplexLp* CplexLp::_cloneSolver() const {return new CplexLp(*this); } |
|
454 |
CplexLp* CplexLp::newSolver() const { return new CplexLp; } |
|
455 |
CplexLp* CplexLp::cloneSolver() const {return new CplexLp(*this); } |
|
456 | 456 |
|
... | ... |
@@ -825,4 +825,4 @@ |
825 | 825 |
|
826 |
CplexMip* CplexMip::_newSolver() const { return new CplexMip; } |
|
827 |
CplexMip* CplexMip::_cloneSolver() const {return new CplexMip(*this); } |
|
826 |
CplexMip* CplexMip::newSolver() const { return new CplexMip; } |
|
827 |
CplexMip* CplexMip::cloneSolver() const {return new CplexMip(*this); } |
|
828 | 828 |
... | ... |
@@ -162,3 +162,3 @@ |
162 | 162 |
///\ingroup lp_group |
163 |
class CplexLp : public |
|
163 |
class CplexLp : public LpSolver, public CplexBase { |
|
164 | 164 |
public: |
... | ... |
@@ -173,2 +173,7 @@ |
173 | 173 |
|
174 |
/// \e |
|
175 |
virtual CplexLp* cloneSolver() const; |
|
176 |
/// \e |
|
177 |
virtual CplexLp* newSolver() const; |
|
178 |
|
|
174 | 179 |
private: |
... | ... |
@@ -188,5 +193,2 @@ |
188 | 193 |
|
189 |
virtual CplexLp* _cloneSolver() const; |
|
190 |
virtual CplexLp* _newSolver() const; |
|
191 |
|
|
192 | 194 |
virtual const char* _solverName() const; |
... | ... |
@@ -224,3 +226,3 @@ |
224 | 226 |
///\ingroup lp_group |
225 |
class CplexMip : public |
|
227 |
class CplexMip : public MipSolver, public CplexBase { |
|
226 | 228 |
public: |
... | ... |
@@ -536,4 +536,4 @@ |
536 | 536 |
|
537 |
GlpkLp* GlpkLp::_newSolver() const { return new GlpkLp; } |
|
538 |
GlpkLp* GlpkLp::_cloneSolver() const { return new GlpkLp(*this); } |
|
537 |
GlpkLp* GlpkLp::newSolver() const { return new GlpkLp; } |
|
538 |
GlpkLp* GlpkLp::cloneSolver() const { return new GlpkLp(*this); } |
|
539 | 539 |
|
... | ... |
@@ -942,4 +942,4 @@ |
942 | 942 |
|
943 |
GlpkMip* GlpkMip::_newSolver() const { return new GlpkMip; } |
|
944 |
GlpkMip* GlpkMip::_cloneSolver() const {return new GlpkMip(*this); } |
|
943 |
GlpkMip* GlpkMip::newSolver() const { return new GlpkMip; } |
|
944 |
GlpkMip* GlpkMip::cloneSolver() const {return new GlpkMip(*this); } |
|
945 | 945 |
... | ... |
@@ -121,3 +121,3 @@ |
121 | 121 |
///\ingroup lp_group |
122 |
class GlpkLp : public |
|
122 |
class GlpkLp : public LpSolver, public GlpkBase { |
|
123 | 123 |
public: |
... | ... |
@@ -129,2 +129,7 @@ |
129 | 129 |
|
130 |
///\e |
|
131 |
virtual GlpkLp* cloneSolver() const; |
|
132 |
///\e |
|
133 |
virtual GlpkLp* newSolver() const; |
|
134 |
|
|
130 | 135 |
private: |
... | ... |
@@ -138,5 +143,2 @@ |
138 | 143 |
|
139 |
virtual GlpkLp* _cloneSolver() const; |
|
140 |
virtual GlpkLp* _newSolver() const; |
|
141 |
|
|
142 | 144 |
virtual const char* _solverName() const; |
... | ... |
@@ -205,3 +207,3 @@ |
205 | 207 |
///\ingroup lp_group |
206 |
class GlpkMip : public |
|
208 |
class GlpkMip : public MipSolver, public GlpkBase { |
|
207 | 209 |
public: |
... | ... |
@@ -213,7 +215,7 @@ |
213 | 215 |
|
216 |
virtual GlpkMip* cloneSolver() const; |
|
217 |
virtual GlpkMip* newSolver() const; |
|
218 |
|
|
214 | 219 |
protected: |
215 | 220 |
|
216 |
virtual GlpkMip* _cloneSolver() const; |
|
217 |
virtual GlpkMip* _newSolver() const; |
|
218 |
|
|
219 | 221 |
virtual const char* _solverName() const; |
... | ... |
@@ -920,4 +920,2 @@ |
920 | 920 |
//Abstract virtual functions |
921 |
virtual LpBase* _newSolver() const = 0; |
|
922 |
virtual LpBase* _cloneSolver() const = 0; |
|
923 | 921 |
|
... | ... |
@@ -989,7 +987,2 @@ |
989 | 987 |
|
990 |
///Creates a new LP problem |
|
991 |
LpBase* newSolver() {return _newSolver();} |
|
992 |
///Makes a copy of the LP problem |
|
993 |
LpBase* cloneSolver() {return _cloneSolver();} |
|
994 |
|
|
995 | 988 |
///Gives back the name of the solver. |
... | ... |
@@ -1823,2 +1816,7 @@ |
1823 | 1816 |
|
1817 |
///Allocate a new LP problem instance |
|
1818 |
virtual LpSolver* newSolver() const = 0; |
|
1819 |
///Make a copy of the LP problem |
|
1820 |
virtual LpSolver* cloneSolver() const = 0; |
|
1821 |
|
|
1824 | 1822 |
///\name Solve the LP |
... | ... |
@@ -1937,9 +1935,4 @@ |
1937 | 1935 |
|
1938 |
LpSolver* newSolver() {return _newSolver();} |
|
1939 |
LpSolver* cloneSolver() {return _cloneSolver();} |
|
1940 |
|
|
1941 | 1936 |
protected: |
1942 | 1937 |
|
1943 |
virtual LpSolver* _newSolver() const = 0; |
|
1944 |
virtual LpSolver* _cloneSolver() const = 0; |
|
1945 | 1938 |
}; |
... | ... |
@@ -1977,2 +1970,7 @@ |
1977 | 1970 |
|
1971 |
///Allocate a new MIP problem instance |
|
1972 |
virtual MipSolver* newSolver() const = 0; |
|
1973 |
///Make a copy of the MIP problem |
|
1974 |
virtual MipSolver* cloneSolver() const = 0; |
|
1975 |
|
|
1978 | 1976 |
///\name Solve the MIP |
... | ... |
@@ -2064,11 +2062,2 @@ |
2064 | 2062 |
|
2065 |
public: |
|
2066 |
|
|
2067 |
MipSolver* newSolver() {return _newSolver();} |
|
2068 |
MipSolver* cloneSolver() {return _cloneSolver();} |
|
2069 |
|
|
2070 |
protected: |
|
2071 |
|
|
2072 |
virtual MipSolver* _newSolver() const = 0; |
|
2073 |
virtual MipSolver* _cloneSolver() const = 0; |
|
2074 | 2063 |
}; |
... | ... |
@@ -107,6 +107,6 @@ |
107 | 107 |
|
108 |
LpSkeleton* LpSkeleton:: |
|
108 |
LpSkeleton* LpSkeleton::newSolver() const |
|
109 | 109 |
{ return static_cast<LpSkeleton*>(0); } |
110 | 110 |
|
111 |
LpSkeleton* LpSkeleton:: |
|
111 |
LpSkeleton* LpSkeleton::cloneSolver() const |
|
112 | 112 |
{ return static_cast<LpSkeleton*>(0); } |
... | ... |
@@ -124,6 +124,6 @@ |
124 | 124 |
|
125 |
MipSkeleton* MipSkeleton:: |
|
125 |
MipSkeleton* MipSkeleton::newSolver() const |
|
126 | 126 |
{ return static_cast<MipSkeleton*>(0); } |
127 | 127 |
|
128 |
MipSkeleton* MipSkeleton:: |
|
128 |
MipSkeleton* MipSkeleton::cloneSolver() const |
|
129 | 129 |
{ return static_cast<MipSkeleton*>(0); } |
... | ... |
@@ -24,6 +24,12 @@ |
24 | 24 |
///\file |
25 |
///\brief |
|
25 |
///\brief Skeleton file to implement LP/MIP solver interfaces |
|
26 |
/// |
|
27 |
///The classes in this file do nothing, but they can serve as skeletons when |
|
28 |
///implementing an interface to new solvers. |
|
26 | 29 |
namespace lemon { |
27 | 30 |
|
28 |
///A skeleton class to implement LP solver |
|
31 |
///A skeleton class to implement LP/MIP solver base interface |
|
32 |
|
|
33 |
///This class does nothing, but it can serve as a skeleton when |
|
34 |
///implementing an interface to new solvers. |
|
29 | 35 |
class SkeletonSolverBase : public virtual LpBase { |
... | ... |
@@ -138,10 +144,16 @@ |
138 | 144 |
|
139 |
/// \brief |
|
145 |
/// \brief Skeleton class for an LP solver interface |
|
140 | 146 |
/// |
141 |
/// |
|
147 |
///This class does nothing, but it can serve as a skeleton when |
|
148 |
///implementing an interface to new solvers. |
|
149 |
|
|
142 | 150 |
///\ingroup lp_group |
143 |
class LpSkeleton : public |
|
151 |
class LpSkeleton : public LpSolver, public SkeletonSolverBase { |
|
144 | 152 |
public: |
145 |
LpSkeleton() : SkeletonSolverBase(), LpSolver() {} |
|
146 |
|
|
153 |
///\e |
|
154 |
LpSkeleton() : LpSolver(), SkeletonSolverBase() {} |
|
155 |
///\e |
|
156 |
virtual LpSkeleton* newSolver() const; |
|
157 |
///\e |
|
158 |
virtual LpSkeleton* cloneSolver() const; |
|
147 | 159 |
protected: |
... | ... |
@@ -175,6 +187,2 @@ |
175 | 187 |
///\e |
176 |
virtual LpSkeleton* _newSolver() const; |
|
177 |
///\e |
|
178 |
virtual LpSkeleton* _cloneSolver() const; |
|
179 |
///\e |
|
180 | 188 |
virtual const char* _solverName() const; |
... | ... |
@@ -183,9 +191,15 @@ |
183 | 191 |
|
184 |
/// \brief |
|
192 |
/// \brief Skeleton class for a MIP solver interface |
|
185 | 193 |
/// |
186 |
/// |
|
194 |
///This class does nothing, but it can serve as a skeleton when |
|
195 |
///implementing an interface to new solvers. |
|
187 | 196 |
///\ingroup lp_group |
188 |
class MipSkeleton : public |
|
197 |
class MipSkeleton : public MipSolver, public SkeletonSolverBase { |
|
189 | 198 |
public: |
190 |
|
|
199 |
///\e |
|
200 |
MipSkeleton() : MipSolver(), SkeletonSolverBase() {} |
|
201 |
///\e |
|
202 |
virtual MipSkeleton* newSolver() const; |
|
203 |
///\e |
|
204 |
virtual MipSkeleton* cloneSolver() const; |
|
191 | 205 |
|
... | ... |
@@ -217,9 +231,3 @@ |
217 | 231 |
///\e |
218 |
virtual MipSkeleton* _newSolver() const; |
|
219 |
|
|
220 |
///\e |
|
221 |
virtual MipSkeleton* _cloneSolver() const; |
|
222 |
///\e |
|
223 | 232 |
virtual const char* _solverName() const; |
224 |
|
|
225 | 233 |
}; |
... | ... |
@@ -56,3 +56,3 @@ |
56 | 56 |
|
57 |
SoplexLp* SoplexLp:: |
|
57 |
SoplexLp* SoplexLp::newSolver() const { |
|
58 | 58 |
SoplexLp* newlp = new SoplexLp(); |
... | ... |
@@ -61,3 +61,3 @@ |
61 | 61 |
|
62 |
SoplexLp* SoplexLp:: |
|
62 |
SoplexLp* SoplexLp::cloneSolver() const { |
|
63 | 63 |
SoplexLp* newlp = new SoplexLp(*this); |
... | ... |
@@ -75,2 +75,6 @@ |
75 | 75 |
~SoplexLp(); |
76 |
/// \e |
|
77 |
virtual SoplexLp* newSolver() const; |
|
78 |
/// \e |
|
79 |
virtual SoplexLp* cloneSolver() const; |
|
76 | 80 |
|
... | ... |
@@ -78,5 +82,2 @@ |
78 | 82 |
|
79 |
virtual SoplexLp* _newSolver() const; |
|
80 |
virtual SoplexLp* _cloneSolver() const; |
|
81 |
|
|
82 | 83 |
virtual const char* _solverName() const; |
... | ... |
@@ -199,2 +199,7 @@ |
199 | 199 |
|
200 |
//Test for clone/new |
|
201 |
LP* lpnew = lp.newSolver(); |
|
202 |
LP* lpclone = lp.cloneSolver(); |
|
203 |
delete lpnew; |
|
204 |
delete lpclone; |
|
200 | 205 |
|
... | ... |
@@ -249,3 +254,4 @@ |
249 | 254 |
std::ostringstream sbuf; |
250 |
sbuf << "Wrong optimal value |
|
255 |
sbuf << "Wrong optimal value (" << lp.primal() <<") with " |
|
256 |
<< lp.solverName() <<"\n the right optimum is " << exp_opt; |
|
251 | 257 |
check(std::abs(lp.primal()-exp_opt) < 1e-3, sbuf.str()); |
... | ... |
@@ -357,2 +363,15 @@ |
357 | 363 |
|
364 |
template<class LP> |
|
365 |
void cloneTest() |
|
366 |
{ |
|
367 |
//Test for clone/new |
|
368 |
|
|
369 |
LP* lp = new LP(); |
|
370 |
LP* lpnew = lp->newSolver(); |
|
371 |
LP* lpclone = lp->cloneSolver(); |
|
372 |
delete lp; |
|
373 |
delete lpnew; |
|
374 |
delete lpclone; |
|
375 |
} |
|
376 |
|
|
358 | 377 |
int main() |
... | ... |
@@ -367,2 +386,3 @@ |
367 | 386 |
aTest(lp_glpk2); |
387 |
cloneTest<GlpkLp>(); |
|
368 | 388 |
} |
... | ... |
@@ -383,2 +403,3 @@ |
383 | 403 |
} |
404 |
cloneTest<CplexLp>(); |
|
384 | 405 |
#endif |
... | ... |
@@ -390,2 +411,3 @@ |
390 | 411 |
aTest(lp_soplex2); |
412 |
cloneTest<SoplexLp>(); |
|
391 | 413 |
} |
... | ... |
@@ -398,2 +420,3 @@ |
398 | 420 |
aTest(lp_clp2); |
421 |
cloneTest<ClpLp>(); |
|
399 | 422 |
} |
... | ... |
@@ -108,2 +108,13 @@ |
108 | 108 |
|
109 |
template<class MIP> |
|
110 |
void cloneTest() |
|
111 |
{ |
|
112 |
|
|
113 |
MIP* mip = new MIP(); |
|
114 |
MIP* mipnew = mip->newSolver(); |
|
115 |
MIP* mipclone = mip->cloneSolver(); |
|
116 |
delete mip; |
|
117 |
delete mipnew; |
|
118 |
delete mipclone; |
|
119 |
} |
|
109 | 120 |
|
... | ... |
@@ -116,2 +127,3 @@ |
116 | 127 |
aTest(mip1); |
128 |
cloneTest<GlpkMip>(); |
|
117 | 129 |
} |
... | ... |
@@ -131,2 +143,3 @@ |
131 | 143 |
} |
144 |
cloneTest<CplexMip>(); |
|
132 | 145 |
#endif |
0 comments (0 inline)