Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
8.3 kB · 312 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * Mikael Lagerkvist <lagerkvist@gecode.org> * Vincent Barichard <Vincent.Barichard@univ-angers.fr> * * Copyright: * Christian Schulte, 2005 * Mikael Lagerkvist, 2006 * 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. * */
namespace Test { namespace Float {
/* * Assignments * */ inline Assignment::Assignment(int n0, const Gecode::FloatVal& d0) : n(n0), d(d0) {} inline int Assignment::size(void) const { return n; } inline Assignment::~Assignment(void) {}
inline CpltAssignment::CpltAssignment(int n, const Gecode::FloatVal& d, Gecode::FloatNum s) : Assignment(n,d), dsv(new Gecode::FloatVal[static_cast<unsigned int>(n)]), step(s) { using namespace Gecode; for (int i=n; i--; ) dsv[i] = FloatVal(d.min(),nextafter(d.min(),d.max())); } inline bool CpltAssignment::has_more() const { return dsv[0].min() <= d.max(); } inline Gecode::FloatVal CpltAssignment::operator[](int i) const { assert((i>=0) && (i<n)); return dsv[i]; } inline void CpltAssignment::set(int i, const Gecode::FloatVal& val) { assert((i>=0) && (i<n)); dsv[i] = val; } inline CpltAssignment::~CpltAssignment(void) { delete [] dsv; }
inline ExtAssignment::ExtAssignment(int n, const Gecode::FloatVal& d, Gecode::FloatNum s, const Test* pb, Gecode::Support::RandomGenerator& rand) : Assignment(n,d),curPb(pb), dsv(new Gecode::FloatVal[static_cast<unsigned int>(n)]), step(s) { using namespace Gecode; for (int i=n-1; i--; ) dsv[i] = FloatVal(d.min(),nextafter(d.min(),d.max())); (*this).next(rand); } inline bool ExtAssignment::has_more() const { return dsv[0].min() <= d.max(); } inline Gecode::FloatVal ExtAssignment::operator[](int i) const { assert((i>=0) && (i<n)); return dsv[i]; } inline void ExtAssignment::set(int i, const Gecode::FloatVal& val) { assert((i>=0) && (i<n)); dsv[i] = val; } inline ExtAssignment::~ExtAssignment(void) { delete [] dsv; }
forceinline Gecode::FloatNum RandomAssignment::randval(Gecode::Support::RandomGenerator& rand) { using namespace Gecode; using namespace Gecode::Float; Rounding r; return r.add_down( d.min(), r.mul_down( r.div_down( rand(static_cast<unsigned int>(Gecode::Int::Limits::max)), static_cast<FloatNum>(Gecode::Int::Limits::max) ), r.sub_down(d.max(),d.min()) ) ); }
inline RandomAssignment::RandomAssignment(int n, const Gecode::FloatVal& d, int a0, Gecode::Support::RandomGenerator& rand) : Assignment(n,d), vals(new Gecode::FloatVal[n]), a(a0) { for (int i=n; i--; ) vals[i] = randval(rand); }
inline bool RandomAssignment::has_more() const { return a>0; } inline Gecode::FloatVal RandomAssignment::operator[](int i) const { assert((i>=0) && (i<n)); return vals[i]; } inline void RandomAssignment::set(int i, const Gecode::FloatVal& val) { assert((i>=0) && (i<n)); vals[i] = val; } inline RandomAssignment::~RandomAssignment(void) { delete [] vals; }
/* * Tests with float constraints * */ forceinline bool Test::eqv(void) const { return reified && ((rms & (1 << Gecode::RM_EQV)) != 0); } forceinline bool Test::imp(void) const { return reified && ((rms & (1 << Gecode::RM_IMP)) != 0); } forceinline bool Test::pmi(void) const { return reified && ((rms & (1 << Gecode::RM_PMI)) != 0); } inline Test::Test(const std::string& s, int a, const Gecode::FloatVal& d, Gecode::FloatNum st, AssignmentType at, bool r) : Base("Float::"+s), arity(a), dom(d), step(st), assigmentType(at), reified(r), rms((1 << Gecode::RM_EQV) | (1 << Gecode::RM_IMP) | (1 << Gecode::RM_PMI)), testsearch(true), testfix(true), testsubsumed(true) {}
inline Test::Test(const std::string& s, int a, Gecode::FloatNum min, Gecode::FloatNum max, Gecode::FloatNum st, AssignmentType at, bool r) : Base("Float::"+s), arity(a), dom(min,max), step(st), assigmentType(at), reified(r), rms((1 << Gecode::RM_EQV) | (1 << Gecode::RM_IMP) | (1 << Gecode::RM_PMI)), testsearch(true), testfix(true), testsubsumed(true) {}
inline std::string Test::str(Gecode::FloatRelType frt) { using namespace Gecode; switch (frt) { case FRT_EQ: return "Eq"; case FRT_NQ: return "Nq"; case FRT_LQ: return "Lq"; case FRT_LE: return "Le"; case FRT_GQ: return "Gq"; case FRT_GR: return "Gr"; default: ; } GECODE_NEVER; return "NONE"; }
inline std::string Test::str(Gecode::FloatNum f) { std::stringstream s; s << f; return s.str(); }
inline std::string Test::str(Gecode::FloatVal f) { std::stringstream s; s << "[" << f.min() << ":" << f.max() << "]"; return s.str(); }
inline std::string Test::str(const Gecode::FloatValArgs& x) { std::string s = ""; for (int i=0; i<x.size()-1; i++) s += str(x[i]) + ","; return "[" + s + str(x[x.size()-1]) + "]"; }
inline MaybeType Test::cmp(Gecode::FloatVal x, Gecode::FloatRelType r, Gecode::FloatVal y) { using namespace Gecode; switch (r) { case FRT_EQ: if (x == y) return MT_TRUE; if (x != y) return MT_FALSE; break; case FRT_NQ: if (x != y) return MT_TRUE; if (x == y) return MT_FALSE; break; case FRT_LQ: if (x <= y) return MT_TRUE; if (x > y) return MT_FALSE; break; case FRT_LE: if (x < y) return MT_TRUE; if (x >= y) return MT_FALSE; break; case FRT_GQ: if (x >= y) return MT_TRUE; if (x < y) return MT_FALSE; break; case FRT_GR: if (x > y) return MT_TRUE; if (x <= y) return MT_FALSE; break; default: ; } return MT_MAYBE; }
inline MaybeType Test::eq(Gecode::FloatVal x, Gecode::FloatVal y) { return cmp(x, Gecode::FRT_EQ, y); }
inline bool Test::flip(void) { return _rand(2U) == 0U; }
inline MaybeType operator &(MaybeType a, MaybeType b) { switch (a) { case MT_TRUE: return b; case MT_FALSE: return MT_FALSE; default: ; } return (b == MT_FALSE) ? MT_FALSE : MT_MAYBE; }
inline FloatRelTypes::FloatRelTypes(void) : i(sizeof(frts)/sizeof(Gecode::FloatRelType)-1) {} inline void FloatRelTypes::reset(void) { i = sizeof(frts)/sizeof(Gecode::FloatRelType)-1; } inline bool FloatRelTypes::operator()(void) const { return i>=0; } inline void FloatRelTypes::operator++(void) { i--; } inline Gecode::FloatRelType FloatRelTypes::frt(void) const { return frts[i]; }
}}
// STATISTICS: test-float