Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
35 kB · 979 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * Vincent Barichard <Vincent.Barichard@univ-angers.fr> * * Copyright: * Christian Schulte, 2005 * Vincent Barichard, 2012 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include "test/float.hh"
#include <gecode/minimodel.hh>
#include <cmath>#include <algorithm>
namespace Test { namespace Float {
/// %Tests for arithmetic constraints namespace Arithmetic {
/** * \defgroup TaskTestFloatArithmetic Arithmetic constraints * \ingroup TaskTestFloat */ //@{ /// %Test for multiplication constraint class MultXYZ : public Test { public: /// Create and register test MultXYZ(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XYZ::"+s,3,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[1], x[2]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::mult(home, x[0], x[1], x[2]); else Gecode::rel(home, x[0] * x[1] == x[2]); } };
/// %Test for multiplication constraint when solution is ensured class MultXYZSol : public Test { public: /// Create and register test MultXYZSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XYZ::Sol::"+s,3,d,st,EXTEND_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[1], x[2]); } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { Gecode::FloatVal d = x[0]*x[1]; if (Gecode::Float::subset(d, dom)) { x.set(2, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::mult(home, x[0], x[1], x[2]); } };
/// %Test for multiplication constraint with shared variables class MultXXY : public Test { public: /// Create and register test MultXXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XXY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[0], x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::mult(home, x[0], x[0], x[1]); } };
/// %Test for multiplication constraint with shared variables when solution is ensured class MultXXYSol : public Test { public: /// Create and register test MultXXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XXY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[0], x[1]); } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { Gecode::FloatVal d = x[0]*x[0]; if (Gecode::Float::subset(d, dom)) { x.set(1, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::mult(home, x[0], x[0], x[1]); } };
/// %Test for multiplication constraint with shared variables class MultXYX : public Test { public: /// Create and register test MultXYX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XYX::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[1], x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::mult(home, x[0], x[1], x[0]); } };
/// %Test for multiplication constraint with shared variables class MultXYY : public Test { public: /// Create and register test MultXYY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XYY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[1], x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::mult(home, x[0], x[1], x[1]); } };
/// %Test for multiplication constraint with shared variables class MultXXX : public Test { public: /// Create and register test MultXXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Mult::XXX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[0], x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::mult(home, x[0], x[0], x[0]); } };
/// %Test for division constraint class Div : public Test { public: /// Create and register test Div(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Div::"+s,3,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] / x[1], x[2]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::div(home, x[0], x[1], x[2]); else Gecode::rel(home, x[0] / x[1] == x[2]); } };
/// %Test for division constraint when solution is ensured class DivSol : public Test { public: /// Create and register test DivSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Div::Sol::"+s,3,d,st,EXTEND_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] / x[1], x[2]); } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { Gecode::FloatVal d = x[0]/x[1]; if (Gecode::Float::subset(d, dom)) { x.set(2, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::div(home, x[0], x[1], x[2]); } };
/// %Test for squaring constraint class SqrXY : public Test { public: /// Create and register test SqrXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Sqr::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[0], x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::sqr(home, x[0], x[1]); else Gecode::rel(home, sqr(x[0]) == x[1]); } };
/// %Test for squaring constraint where solution is ensured class SqrXYSol : public Test { public: /// Create and register test SqrXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Sqr::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[0], x[1]); } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { Gecode::FloatVal d = sqr(x[0]); if (Gecode::Float::subset(d, dom)) { x.set(1, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::sqr(home, x[0], x[1]); } };
/// %Test for squaring constraint with shared variables class SqrXX : public Test { public: /// Create and register test SqrXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Sqr::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(x[0] * x[0], x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::sqr(home, x[0], x[0]); } };
/// %Test for square root constraint class SqrtXY : public Test { public: /// Create and register test SqrtXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Sqrt::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { switch (cmp(x[0], Gecode::FRT_GQ, 0.0)) { case MT_FALSE: return MT_FALSE; case MT_MAYBE: return MT_MAYBE; default: return eq(sqrt(x[0]), x[1]); } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::sqrt(home, x[0], x[1]); else Gecode::rel(home, sqrt(x[0]) == x[1]); } };
/// %Test for square root constraint where solution is ensured class SqrtXYSol : public Test { public: /// Create and register test SqrtXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Sqrt::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { switch (cmp(x[0], Gecode::FRT_GQ, 0.0)) { case MT_FALSE: return MT_FALSE; case MT_MAYBE: return MT_MAYBE; default: return eq(sqrt(x[0]), x[1]); } } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { Gecode::FloatVal d = sqrt(abs(x[0])); if (Gecode::Float::subset(d, dom)) { x.set(1, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::sqrt(home, x[0], x[1]); } };
/// %Test for square root constraint with shared variables class SqrtXX : public Test { public: /// Create and register test SqrtXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Sqrt::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { switch (cmp(x[0], Gecode::FRT_GQ, 0.0)) { case MT_FALSE: return MT_FALSE; case MT_MAYBE: return MT_MAYBE; default: return eq(sqrt(x[0]), x[0]); } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::sqrt(home, x[0], x[0]); } };
/// %Test for pow constraint class PowXY : public Test { unsigned int n; public: /// Create and register test PowXY(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st) : Test("Arithmetic::Pow::N::"+str(_n)+"::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false), n(_n) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(pow(x[0],n), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::pow(home, x[0], n, x[1]); else Gecode::rel(home, pow(x[0],n) == x[1]); } };
/// %Test for pow constraint where solution is ensured class PowXYSol : public Test { unsigned int n; public: /// Create and register test PowXYSol(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st) : Test("Arithmetic::Pow::N::"+str(_n)+"::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false), n(_n) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(pow(x[0],n), x[1]); } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { Gecode::FloatVal d = pow(x[0],n); if (Gecode::Float::subset(d, dom)) { x.set(1, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::pow(home, x[0], n, x[1]); } };
/// %Test for pow constraint with shared variables class PowXX : public Test { unsigned int n; public: /// Create and register test PowXX(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st) : Test("Arithmetic::Pow::N::"+str(_n)+"::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(pow(x[0],n), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::pow(home, x[0], n, x[0]); } };
/// %Test for nroot constraint class NRootXY : public Test { unsigned int n; public: /// Create and register test NRootXY(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st) : Test("Arithmetic::NRoot::N::"+str(_n)+"::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false), n(_n) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { if ((n == 0) || (x[0].max() < 0.0)) return MT_FALSE; return eq(nroot(x[0],n), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::nroot(home, x[0], n, x[1]); else Gecode::rel(home, nroot(x[0],n) == x[1]); } };
/// %Test for nroot constraint where solution is ensured class NRootXYSol : public Test { unsigned int n; public: /// Create and register test NRootXYSol(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st) : Test("Arithmetic::NRoot::N::"+str(_n)+"::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false), n(_n) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { if ((n == 0) || (x[0].max() < 0.0)) return MT_FALSE; return eq(nroot(x[0],n), x[1]); } /// Extend assignment \a x virtual bool extendAssignement(Assignment& x) const { if ((n == 0) || (x[0].max() < 0)) return false; Gecode::FloatVal d = nroot(x[0],n); if (Gecode::Float::subset(d, dom)) { x.set(1, d); return true; } else { return false; } } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::nroot(home, x[0], n, x[1]); } };
/// %Test for nroot constraint with shared variables class NRootXX : public Test { unsigned int n; public: /// Create and register test NRootXX(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st) : Test("Arithmetic::NRoot::N::"+str(_n)+"::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { if ((n == 0) || (x[0].max() < 0)) return MT_FALSE; return eq(nroot(x[0],n), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::nroot(home, x[0], n, x[0]); } };
/// %Test for absolute value constraint class AbsXY : public Test { public: /// Create and register test AbsXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Abs::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(abs(x[0]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::abs(home, x[0], x[1]); else Gecode::rel(home, abs(x[0]) == x[1]); } };
/// %Test for absolute value constraint with shared variables class AbsXX : public Test { public: /// Create and register test AbsXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Abs::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(abs(x[0]), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::abs(home, x[0], x[0]); } };
/// %Test for binary minimum constraint class MinXYZ : public Test { public: /// Create and register test MinXYZ(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Min::Bin::XYZ::"+s,3,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(x[0],x[1]), x[2]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::min(home, x[0], x[1], x[2]); else Gecode::rel(home, min(x[0],x[1]) == x[2]); } };
/// %Test for binary minimum constraint with shared variables class MinXXY : public Test { public: /// Create and register test MinXXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Min::Bin::XXY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(x[0],x[0]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::min(home, x[0], x[0], x[1]); } };
/// %Test for binary minimum constraint with shared variables class MinXYX : public Test { public: /// Create and register test MinXYX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Min::Bin::XYX::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(x[0],x[1]), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::min(home, x[0], x[1], x[0]); } };
/// %Test for binary minimum constraint with shared variables class MinXYY : public Test { public: /// Create and register test MinXYY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Min::Bin::XYY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(x[0],x[1]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::min(home, x[0], x[1], x[1]); } };
/// %Test for binary minimum constraint with shared variables class MinXXX : public Test { public: /// Create and register test MinXXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Min::Bin::XXX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(x[0],x[0]), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::min(home, x[0], x[0], x[0]); } };
/// %Test for binary maximum constraint class MaxXYZ : public Test { public: /// Create and register test MaxXYZ(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Max::Bin::XYZ::"+s,3,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(x[0],x[1]), x[2]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { if (flip()) Gecode::max(home, x[0], x[1], x[2]); else Gecode::rel(home, max(x[0], x[1]) == x[2]); } };
/// %Test for binary maximum constraint with shared variables class MaxXXY : public Test { public: /// Create and register test MaxXXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Max::Bin::XXY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(x[0],x[0]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::max(home, x[0], x[0], x[1]); } };
/// %Test for binary maximum constraint with shared variables class MaxXYX : public Test { public: /// Create and register test MaxXYX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Max::Bin::XYX::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(x[0],x[1]), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::max(home, x[0], x[1], x[0]); } };
/// %Test for binary maximum constraint with shared variables class MaxXYY : public Test { public: /// Create and register test MaxXYY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Max::Bin::XYY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(x[0],x[1]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::max(home, x[0], x[1], x[1]); } };
/// %Test for binary maximum constraint with shared variables class MaxXXX : public Test { public: /// Create and register test MaxXXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st) : Test("Arithmetic::Max::Bin::XXX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(x[0],x[0]), x[0]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::max(home, x[0], x[0], x[0]); } };
/// %Test for n-ary minimmum constraint class MinNary : public Test { public: /// Create and register test MinNary(void) : Test("Arithmetic::Min::Nary",4,-4,4,0.5,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(min(x[0],x[1]),x[2]), x[3]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::FloatVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2]; if (flip()) Gecode::min(home, m, x[3]); else Gecode::rel(home, min(m) == x[3]); } };
/// %Test for n-ary minimmum constraint with shared variables class MinNaryShared : public Test { public: /// Create and register test MinNaryShared(void) : Test("Arithmetic::Min::Nary::Shared",3,-4,4,0.5,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(min(min(x[0],x[1]),x[2]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::FloatVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2]; Gecode::min(home, m, x[1]); } };
/// %Test for n-ary maximum constraint class MaxNary : public Test { public: /// Create and register test MaxNary(void) : Test("Arithmetic::Max::Nary",4,-4,4,0.5,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(max(x[0],x[1]),x[2]), x[3]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::FloatVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2]; if (flip()) Gecode::max(home, m, x[3]); else Gecode::rel(home, max(m) == x[3]); } };
/// %Test for n-ary maximum constraint with shared variables class MaxNaryShared : public Test { public: /// Create and register test MaxNaryShared(void) : Test("Arithmetic::Max::Nary::Shared",3,-4,4,0.5,CPLT_ASSIGNMENT,false) {} /// %Test whether \a x is solution virtual MaybeType solution(const Assignment& x) const { return eq(max(max(x[0],x[1]),x[2]), x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) { Gecode::FloatVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2]; Gecode::max(home, m, x[1]); } };
const Gecode::FloatNum step = 0.15; Gecode::FloatVal a(-8,5); Gecode::FloatVal b(9,12); Gecode::FloatVal c(-8,8);
MultXXY mult_xxy_a("A",a,step); MultXXY mult_xxy_b("B",b,step); MultXXY mult_xxy_c("C",c,step);
MultXXYSol mult_xxy_sol_a("A",a,step); MultXXYSol mult_xxy_sol_b("B",b,step); MultXXYSol mult_xxy_sol_c("C",c,step);
MultXYX mult_xyx_a("A",a,step); MultXYX mult_xyx_b("B",b,step); MultXYX mult_xyx_c("C",c,step);
MultXYY mult_xyy_a("A",a,step); MultXYY mult_xyy_b("B",b,step); MultXYY mult_xyy_c("C",c,step);
MultXXX mult_xxx_a("A",a,step); MultXXX mult_xxx_b("B",b,step); MultXXX mult_xxx_c("C",c,step);
MultXYZ mult_xyz_a("A",a,step); MultXYZ mult_xyz_b("B",b,step); MultXYZ mult_xyz_c("C",c,step);
MultXYZSol mult_xyz_sol_a("A",a,step); MultXYZSol mult_xyz_sol_b("B",b,step); MultXYZSol mult_xyz_sol_c("C",c,step);
Div div_a("A",a,step); Div div_b("B",b,step); Div div_c("C",c,step);
DivSol div_sol_a("A",a,step); DivSol div_sol_b("B",b,step); DivSol div_sol_c("C",c,step);
SqrXY sqr_xy_a("A",a,step); SqrXY sqr_xy_b("B",b,step); SqrXY sqr_xy_c("C",c,step);
SqrXYSol sqr_xy_sol_a("A",a,step); SqrXYSol sqr_xy_sol_b("B",b,step); SqrXYSol sqr_xy_sol_c("C",c,step);
SqrXX sqr_xx_a("A",a,step); SqrXX sqr_xx_b("B",b,step); SqrXX sqr_xx_c("C",c,step);
SqrtXY sqrt_xy_a("A",a,step); SqrtXY sqrt_xy_b("B",b,step); SqrtXY sqrt_xy_c("C",c,step);
SqrtXYSol sqrt_xy_sol_a("A",a,step); SqrtXYSol sqrt_xy_sol_b("B",b,step); SqrtXYSol sqrt_xy_sol_c("C",c,step);
SqrtXX sqrt_xx_a("A",a,step); SqrtXX sqrt_xx_b("B",b,step); SqrtXX sqrt_xx_c("C",c,step);
PowXY pow_xy_a_1("A",a,2,step); PowXY pow_xy_b_1("B",b,2,step); PowXY pow_xy_c_1("C",c,2,step);
PowXYSol pow_xy_sol_a_1("A",a,2,step); PowXYSol pow_xy_sol_b_1("B",b,2,step); PowXYSol pow_xy_sol_c_1("C",c,2,step);
PowXX pow_xx_a_1("A",a,2,step); PowXX pow_xx_b_1("B",b,2,step); PowXX pow_xx_c_1("C",c,2,step);
PowXY pow_xy_a_2("A",a,3,step); PowXY pow_xy_b_2("B",b,3,step); PowXY pow_xy_c_2("C",c,3,step);
PowXYSol pow_xy_sol_a_2("A",a,3,step); PowXYSol pow_xy_sol_b_2("B",b,3,step); PowXYSol pow_xy_sol_c_2("C",c,3,step);
PowXX pow_xx_a_2("A",a,3,step); PowXX pow_xx_b_2("B",b,3,step); PowXX pow_xx_c_2("C",c,3,step);
PowXY pow_xy_a_3("A",a,0,step); PowXY pow_xy_b_3("B",b,0,step); PowXY pow_xy_c_3("C",c,0,step);
PowXYSol pow_xy_sol_a_3("A",a,0,step); PowXYSol pow_xy_sol_b_3("B",b,0,step); PowXYSol pow_xy_sol_c_3("C",c,0,step);
PowXX pow_xx_a_3("A",a,0,step); PowXX pow_xx_b_3("B",b,0,step); PowXX pow_xx_c_3("C",c,0,step);
NRootXY nroot_xy_a_1("A",a,2,step); NRootXY nroot_xy_b_1("B",b,2,step); NRootXY nroot_xy_c_1("C",c,2,step);
NRootXYSol nroot_xy_sol_a_1("A",a,2,step); NRootXYSol nroot_xy_sol_b_1("B",b,2,step); NRootXYSol nroot_xy_sol_c_1("C",c,2,step);
NRootXX nroot_xx_a_1("A",a,2,step); NRootXX nroot_xx_b_1("B",b,2,step); NRootXX nroot_xx_c_1("C",c,2,step);
NRootXY nroot_xy_a_2("A",a,3,step); NRootXY nroot_xy_b_2("B",b,3,step); NRootXY nroot_xy_c_2("C",c,3,step);
NRootXYSol nroot_xy_sol_a_2("A",a,3,step); NRootXYSol nroot_xy_sol_b_2("B",b,3,step); NRootXYSol nroot_xy_sol_c_2("C",c,3,step);
NRootXX nroot_xx_a_2("A",a,3,step); NRootXX nroot_xx_b_2("B",b,3,step); NRootXX nroot_xx_c_2("C",c,3,step);
NRootXY nroot_xy_a_3("A",a,0,step); NRootXY nroot_xy_b_3("B",b,0,step); NRootXY nroot_xy_c_3("C",c,0,step);
NRootXYSol nroot_xy_sol_a_3("A",a,0,step); NRootXYSol nroot_xy_sol_b_3("B",b,0,step); NRootXYSol nroot_xy_sol_c_3("C",c,0,step);
NRootXX nroot_xx_a_3("A",a,0,step); NRootXX nroot_xx_b_3("B",b,0,step); NRootXX nroot_xx_c_3("C",c,0,step);
AbsXY abs_xy_a("A",a,step); AbsXY abs_xy_b("B",b,step); AbsXY abs_xy_c("C",c,step);
AbsXX abs_xx_a("A",a,step); AbsXX abs_xx_b("B",b,step); AbsXX abs_xx_c("C",c,step);
MinXYZ min_xyz_a("A",a,step); MinXYZ min_xyz_b("B",b,step); MinXYZ min_xyz_c("C",c,step);
MinXXY min_xxy_a("A",a,step); MinXXY min_xxy_b("B",b,step); MinXXY min_xxy_c("C",c,step);
MinXYX min_xyx_a("A",a,step); MinXYX min_xyx_b("B",b,step); MinXYX min_xyx_c("C",c,step);
MinXYY min_xyy_a("A",a,step); MinXYY min_xyy_b("B",b,step); MinXYY min_xyy_c("C",c,step);
MinXXX min_xxx_a("A",a,step); MinXXX min_xxx_b("B",b,step); MinXXX min_xxx_c("C",c,step);
MaxXYZ max_xyz_a("A",a,step); MaxXYZ max_xyz_b("B",b,step); MaxXYZ max_xyz_c("C",c,step);
MaxXXY max_xxy_a("A",a,step); MaxXXY max_xxy_b("B",b,step); MaxXXY max_xxy_c("C",c,step);
MaxXYX max_xyx_a("A",a,step); MaxXYX max_xyx_b("B",b,step); MaxXYX max_xyx_c("C",c,step);
MaxXYY max_xyy_a("A",a,step); MaxXYY max_xyy_b("B",b,step); MaxXYY max_xyy_c("C",c,step);
MaxXXX max_xxx_a("A",a,step); MaxXXX max_xxx_b("B",b,step); MaxXXX max_xxx_c("C",c,step);
MinNary min_nary; MinNaryShared min_s_nary; MaxNary max_nary; MaxNaryShared max_s_nary; //@}
}}}
// STATISTICS: test-float