Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
38 kB · 1201 lines
C++
at develop
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Guido Tack <tack@gecode.org> * Christian Schulte <schulte@gecode.org> * Mikael Lagerkvist <lagerkvist@gecode.org> * * Copyright: * Guido Tack, 2005 * Christian Schulte, 2005 * Mikael Lagerkvist, 2005 * * 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/set.hh"
#include <algorithm>
namespace Test { namespace Set {
CountableSet::CountableSet(const Gecode::IntSet& d0) : d(d0), cur(0) { Gecode::IntSetRanges isr(d); lubmax = static_cast<unsigned int>(pow(static_cast<double>(2.0), static_cast<int>(Gecode::Iter::Ranges::size(isr)))); }
void CountableSet::operator++(void) { cur++; }
void CountableSet::init(const Gecode::IntSet& d0) { d = d0; cur = 0; Gecode::IntSetRanges isr(d); lubmax = static_cast<unsigned int>(pow(static_cast<double>(2.0), static_cast<int>(Gecode::Iter::Ranges::size(isr)))); }
int CountableSet::val(void) const { return cur; }
SetAssignment::SetAssignment(int n0, const Gecode::IntSet& d0, int _withInt) : n(n0), dsv(new CountableSet[n]), ir(_withInt, d0), done(false), lub(d0), withInt(_withInt) { for (int i=n; i--; ) dsv[i].init(lub); }
void SetAssignment::operator++(void) { int i = n-1; while (true) { ++dsv[i]; if (dsv[i]()) return; dsv[i].init(lub); --i; if (i<0) { if (withInt==0) { done = true; return; } ++ir; if (ir()) { i = n-1; for (int j=n; j--; ) dsv[j].init(lub); } else { done = true; return; } } } }
}}
std::ostream&operator<<(std::ostream& os, const Test::Set::SetAssignment& a) { int n = a.size(); os << "{"; for (int i=0; i<n; i++) { Test::Set::CountableSetRanges csv(a.lub, a[i]); Gecode::IntSet icsv(csv); os << icsv << ((i!=n-1) ? "," : "}"); } if (a.withInt > 0) os << a.ints(); return os;}
namespace Test { namespace Set {
SetTestSpace::SetTestSpace(int n, Gecode::IntSet& d0, int i, SetTest* t, bool log) : d(d0), y(*this, i, d), withInt(i), r(Gecode::BoolVar(*this, 0, 1),Gecode::RM_EQV), reified(false), test(t) { using namespace Gecode; IntSet u(Gecode::Set::Limits::min,Gecode::Set::Limits::max); x = SetVarArray(*this, n, Gecode::IntSet::empty, u); SetVarArgs _x(*this, n, Gecode::IntSet::empty, d); if (x.size() == 1) dom(*this,x[0],_x[0]); else dom(*this,x,_x); if (opt.log && log) { olog << ind(2) << "Initial: x[]=" << x; olog << " y[]=" << y; olog << std::endl; } }
SetTestSpace::SetTestSpace(int n, Gecode::IntSet& d0, int i, SetTest* t, Gecode::ReifyMode rm, bool log) : d(d0), x(*this, n, Gecode::IntSet::empty, d), y(*this, i, d), withInt(i), r(Gecode::BoolVar(*this, 0, 1),rm), reified(true), test(t) { if (opt.log && log) { olog << ind(2) << "Initial: x[]=" << x; olog << " y[]=" << y; olog << " b=" << r.var(); olog << std::endl; } }
SetTestSpace::SetTestSpace(SetTestSpace& s) : Gecode::Space(s), d(s.d), withInt(s.withInt), reified(s.reified), test(s.test) { x.update(*this, s.x); y.update(*this, s.y); Gecode::BoolVar b; Gecode::BoolVar sr(s.r.var()); b.update(*this, sr); r.var(b); r.mode(s.r.mode()); }
Gecode::Space* SetTestSpace::copy(void) { return new SetTestSpace(*this); }
void SetTestSpace::post(void) { if (reified){ test->post(*this,x,y,r); if (opt.log) olog << ind(3) << "Posting reified propagator" << std::endl; } else { test->post(*this,x,y); if (opt.log) olog << ind(3) << "Posting propagator" << std::endl; } }
bool SetTestSpace::failed(void) { if (opt.log) { olog << ind(3) << "Fixpoint: x[]=" << x << " y[]=" << y << std::endl; bool f=(status() == Gecode::SS_FAILED); olog << ind(3) << " --> x[]=" << x << " y[]=" << y << std::endl; return f; } else { return status() == Gecode::SS_FAILED; } }
bool SetTestSpace::subsumed(bool b) { return b ? (propagators() == 0) : true; }
void SetTestSpace::rel(int i, Gecode::SetRelType srt, const Gecode::IntSet& is) { if (opt.log) { olog << ind(4) << "x[" << i << "] "; switch (srt) { case Gecode::SRT_EQ: olog << "="; break; case Gecode::SRT_LQ: olog << "<="; break; case Gecode::SRT_LE: olog << "<"; break; case Gecode::SRT_GQ: olog << ">="; break; case Gecode::SRT_GR: olog << ">"; break; case Gecode::SRT_NQ: olog << "!="; break; case Gecode::SRT_SUB: olog << "sub"; break; case Gecode::SRT_SUP: olog << "sup"; break; case Gecode::SRT_DISJ: olog << "||"; break; case Gecode::SRT_CMPL: olog << "^-1 = "; break; } olog << is << std::endl; } Gecode::dom(*this, x[i], srt, is); }
void SetTestSpace::cardinality(int i, int cmin, int cmax) { if (opt.log) { olog << ind(4) << cmin << " <= #(x[" << i << "]) <= " << cmax << std::endl; } Gecode::cardinality(*this, x[i], cmin, cmax); }
void SetTestSpace::rel(int i, Gecode::IntRelType irt, int n) { if (opt.log) { olog << ind(4) << "y[" << i << "] "; switch (irt) { case Gecode::IRT_EQ: olog << "="; break; case Gecode::IRT_NQ: olog << "!="; break; case Gecode::IRT_LQ: olog << "<="; break; case Gecode::IRT_LE: olog << "<"; break; case Gecode::IRT_GQ: olog << ">="; break; case Gecode::IRT_GR: olog << ">"; break; } olog << " " << n << std::endl; } Gecode::rel(*this, y[i], irt, n); }
void SetTestSpace::rel(bool sol) { int n = sol ? 1 : 0; assert(reified); if (opt.log) olog << ind(4) << "b = " << n << std::endl; Gecode::rel(*this, r.var(), Gecode::IRT_EQ, n); }
void SetTestSpace::assign(const SetAssignment& a) { for (int i=a.size(); i--; ) { CountableSetRanges csv(a.lub, a[i]); Gecode::IntSet ai(csv); rel(i, Gecode::SRT_EQ, ai); if (Base::fixpoint() && failed()) return; } for (int i=withInt; i--; ) { rel(i, Gecode::IRT_EQ, a.ints()[i]); if (Base::fixpoint() && failed()) return; } }
bool SetTestSpace::assigned(void) const { for (int i=x.size(); i--; ) if (!x[i].assigned()) return false; for (int i=y.size(); i--; ) if (!y[i].assigned()) return false; return true; }
void SetTestSpace::removeFromLub(int v, int i, const SetAssignment& a) { using namespace Gecode; SetVarUnknownRanges ur(x[i]); CountableSetRanges air(a.lub, a[i]); Gecode::Iter::Ranges::Diff<Gecode::SetVarUnknownRanges, CountableSetRanges> diff(ur, air); Gecode::Iter::Ranges::ToValues<Gecode::Iter::Ranges::Diff <Gecode::SetVarUnknownRanges, CountableSetRanges> > diffV(diff); for (int j=0; j<v; j++, ++diffV) {} rel(i, Gecode::SRT_DISJ, Gecode::IntSet(diffV.val(), diffV.val())); }
void SetTestSpace::removeFromLub(int v, int i, const SetAssignment& a, SetTestSpace& c) { using namespace Gecode; SetVarUnknownRanges ur(x[i]); CountableSetRanges air(a.lub, a[i]); Gecode::Iter::Ranges::Diff<Gecode::SetVarUnknownRanges, CountableSetRanges> diff(ur, air); Gecode::Iter::Ranges::ToValues<Gecode::Iter::Ranges::Diff <Gecode::SetVarUnknownRanges, CountableSetRanges> > diffV(diff); for (int j=0; j<v; j++, ++diffV) {} rel(i, Gecode::SRT_DISJ, Gecode::IntSet(diffV.val(), diffV.val())); c.rel(i, Gecode::SRT_DISJ, Gecode::IntSet(diffV.val(), diffV.val())); }
void SetTestSpace::addToGlb(int v, int i, const SetAssignment& a) { using namespace Gecode; SetVarUnknownRanges ur(x[i]); CountableSetRanges air(a.lub, a[i]); Gecode::Iter::Ranges::Inter<Gecode::SetVarUnknownRanges, CountableSetRanges> inter(ur, air); Gecode::Iter::Ranges::ToValues<Gecode::Iter::Ranges::Inter <Gecode::SetVarUnknownRanges, CountableSetRanges> > interV(inter); for (int j=0; j<v; j++, ++interV) {} rel(i, Gecode::SRT_SUP, Gecode::IntSet(interV.val(), interV.val())); }
void SetTestSpace::addToGlb(int v, int i, const SetAssignment& a, SetTestSpace& c) { using namespace Gecode; SetVarUnknownRanges ur(x[i]); CountableSetRanges air(a.lub, a[i]); Gecode::Iter::Ranges::Inter<Gecode::SetVarUnknownRanges, CountableSetRanges> inter(ur, air); Gecode::Iter::Ranges::ToValues<Gecode::Iter::Ranges::Inter <Gecode::SetVarUnknownRanges, CountableSetRanges> > interV(inter); for (int j=0; j<v; j++, ++interV) {} rel(i, Gecode::SRT_SUP, Gecode::IntSet(interV.val(), interV.val())); c.rel(i, Gecode::SRT_SUP, Gecode::IntSet(interV.val(), interV.val())); }
bool SetTestSpace::fixprob(void) { if (failed()) return true; SetTestSpace* c = static_cast<SetTestSpace*>(clone()); if (opt.log) olog << ind(3) << "Testing fixpoint on copy" << std::endl; c->post(); if (c->failed()) { delete c; return false; }
for (int i=x.size(); i--; ) if (x[i].glbSize() != c->x[i].glbSize() || x[i].lubSize() != c->x[i].lubSize() || x[i].cardMin() != c->x[i].cardMin() || x[i].cardMax() != c->x[i].cardMax()) { delete c; return false; } for (int i=y.size(); i--; ) if (y[i].size() != c->y[i].size()) { delete c; return false; } if (reified && (r.var().size() != c->r.var().size())) { delete c; return false; } if (opt.log) olog << ind(3) << "Finished testing fixpoint on copy" << std::endl; delete c; return true; }
bool SetTestSpace::same(SetTestSpace& c) { if (opt.log) olog << ind(3) << "Testing whether enabled space is the same" << std::endl; bool f = failed(); bool cf = c.failed(); if (f != cf) return false; if (f) return true;
for (int i=x.size(); i--; ) if (x[i].glbSize() != c.x[i].glbSize() || x[i].lubSize() != c.x[i].lubSize() || x[i].cardMin() != c.x[i].cardMin() || x[i].cardMax() != c.x[i].cardMax()) return false;
for (int i=y.size(); i--; ) if (y[i].size() != c.y[i].size()) return false;
if (reified && (r.var().size() != c.r.var().size())) return false; if (opt.log) olog << ind(3) << "Finished testing whether enabled space is the same" << std::endl; return true; }
bool SetTestSpace::prune(const SetAssignment& a) { using namespace Gecode; bool setsAssigned = true; for (int j=x.size(); j--; ) if (!x[j].assigned()) { setsAssigned = false; break; } bool intsAssigned = true; for (int j=y.size(); j--; ) if (!y[j].assigned()) { intsAssigned = false; break; }
// Select variable to be pruned int i; if (intsAssigned) { i = Base::rand(x.size()); } else if (setsAssigned) { i = Base::rand(y.size()); } else { i = Base::rand(x.size()+y.size()); }
if (setsAssigned || i>=x.size()) { if (i>=x.size()) i = i-x.size(); while (y[i].assigned()) { i = (i+1) % y.size(); } // Prune int var
// Select mode for pruning switch (Base::rand(3)) { case 0: if (a.ints()[i] < y[i].max()) { int v=a.ints()[i]+1+ Base::rand(static_cast<unsigned int>(y[i].max()-a.ints()[i])); assert((v > a.ints()[i]) && (v <= y[i].max())); rel(i, Gecode::IRT_LE, v); } break; case 1: if (a.ints()[i] > y[i].min()) { int v=y[i].min()+ Base::rand(static_cast<unsigned int>(a.ints()[i]-y[i].min())); assert((v < a.ints()[i]) && (v >= y[i].min())); rel(i, Gecode::IRT_GR, v); } break; default: int v; Gecode::Int::ViewRanges<Gecode::Int::IntView> it(y[i]); unsigned int skip = Base::rand(y[i].size()-1); while (true) { if (it.width() > skip) { v = it.min() + skip; if (v == a.ints()[i]) { if (it.width() == 1) { ++it; v = it.min(); } else if (v < it.max()) { ++v; } else { --v; } } break; } skip -= it.width(); ++it; } rel(i, Gecode::IRT_NQ, v); } return (!Base::fixpoint() || fixprob()); } while (x[i].assigned()) { i = (i+1) % x.size(); } Gecode::SetVarUnknownRanges ur1(x[i]); CountableSetRanges air1(a.lub, a[i]); Gecode::Iter::Ranges::Diff<Gecode::SetVarUnknownRanges, CountableSetRanges> diff(ur1, air1); Gecode::SetVarUnknownRanges ur2(x[i]); CountableSetRanges air2(a.lub, a[i]); Gecode::Iter::Ranges::Inter<Gecode::SetVarUnknownRanges, CountableSetRanges> inter(ur2, air2);
CountableSetRanges aisizer(a.lub, a[i]); unsigned int aisize = Gecode::Iter::Ranges::size(aisizer);
// Select mode for pruning switch (Base::rand(5)) { case 0: if (inter()) { int v = Base::rand(Gecode::Iter::Ranges::size(inter)); addToGlb(v, i, a); } break; case 1: if (diff()) { int v = Base::rand(Gecode::Iter::Ranges::size(diff)); removeFromLub(v, i, a); } break; case 2: if (x[i].cardMin() < aisize) { unsigned int newc = x[i].cardMin() + 1 + Base::rand(aisize - x[i].cardMin()); assert( newc > x[i].cardMin() ); assert( newc <= aisize ); cardinality(i, newc, Gecode::Set::Limits::card); } break; case 3: if (x[i].cardMax() > aisize) { unsigned int newc = x[i].cardMax() - 1 - Base::rand(x[i].cardMax() - aisize); assert( newc < x[i].cardMax() ); assert( newc >= aisize ); cardinality(i, 0, newc); } break; default: if (inter()) { int v = Base::rand(Gecode::Iter::Ranges::size(inter)); addToGlb(v, i, a); } else { int v = Base::rand(Gecode::Iter::Ranges::size(diff)); removeFromLub(v, i, a); } } return (!Base::fixpoint() || fixprob()); }
bool SetTestSpace::disabled(const SetAssignment& a, SetTestSpace& c) { c.disable(); using namespace Gecode; bool setsAssigned = true; for (int j=x.size(); j--; ) if (!x[j].assigned()) { setsAssigned = false; break; } bool intsAssigned = true; for (int j=y.size(); j--; ) if (!y[j].assigned()) { intsAssigned = false; break; }
// Select variable to be pruned int i; if (intsAssigned) { i = Base::rand(x.size()); } else if (setsAssigned) { i = Base::rand(y.size()); } else { i = Base::rand(x.size()+y.size()); }
if (setsAssigned || i>=x.size()) { if (i>=x.size()) i = i-x.size(); while (y[i].assigned()) { i = (i+1) % y.size(); } // Prune int var
// Select mode for pruning switch (Base::rand(3)) { case 0: if (a.ints()[i] < y[i].max()) { int v=a.ints()[i]+1+ Base::rand(static_cast<unsigned int>(y[i].max()-a.ints()[i])); assert((v > a.ints()[i]) && (v <= y[i].max())); rel(i, Gecode::IRT_LE, v); c.rel(i, Gecode::IRT_LE, v); } break; case 1: if (a.ints()[i] > y[i].min()) { int v=y[i].min()+ Base::rand(static_cast<unsigned int>(a.ints()[i]-y[i].min())); assert((v < a.ints()[i]) && (v >= y[i].min())); rel(i, Gecode::IRT_GR, v); c.rel(i, Gecode::IRT_GR, v); } break; default: int v; Gecode::Int::ViewRanges<Gecode::Int::IntView> it(y[i]); unsigned int skip = Base::rand(y[i].size()-1); while (true) { if (it.width() > skip) { v = it.min() + skip; if (v == a.ints()[i]) { if (it.width() == 1) { ++it; v = it.min(); } else if (v < it.max()) { ++v; } else { --v; } } break; } skip -= it.width(); ++it; } rel(i, Gecode::IRT_NQ, v); c.rel(i, Gecode::IRT_NQ, v); } c.enable(); return same(c); } while (x[i].assigned()) { i = (i+1) % x.size(); } Gecode::SetVarUnknownRanges ur1(x[i]); CountableSetRanges air1(a.lub, a[i]); Gecode::Iter::Ranges::Diff<Gecode::SetVarUnknownRanges, CountableSetRanges> diff(ur1, air1); Gecode::SetVarUnknownRanges ur2(x[i]); CountableSetRanges air2(a.lub, a[i]); Gecode::Iter::Ranges::Inter<Gecode::SetVarUnknownRanges, CountableSetRanges> inter(ur2, air2);
CountableSetRanges aisizer(a.lub, a[i]); unsigned int aisize = Gecode::Iter::Ranges::size(aisizer);
// Select mode for pruning switch (Base::rand(5)) { case 0: if (inter()) { int v = Base::rand(Gecode::Iter::Ranges::size(inter)); addToGlb(v, i, a, c); } break; case 1: if (diff()) { int v = Base::rand(Gecode::Iter::Ranges::size(diff)); removeFromLub(v, i, a, c); } break; case 2: if (x[i].cardMin() < aisize) { unsigned int newc = x[i].cardMin() + 1 + Base::rand(aisize - x[i].cardMin()); assert( newc > x[i].cardMin() ); assert( newc <= aisize ); cardinality(i, newc, Gecode::Set::Limits::card); c.cardinality(i, newc, Gecode::Set::Limits::card); } break; case 3: if (x[i].cardMax() > aisize) { unsigned int newc = x[i].cardMax() - 1 - Base::rand(x[i].cardMax() - aisize); assert( newc < x[i].cardMax() ); assert( newc >= aisize ); cardinality(i, 0, newc); c.cardinality(i, 0, newc); } break; default: if (inter()) { int v = Base::rand(Gecode::Iter::Ranges::size(inter)); addToGlb(v, i, a, c); } else { int v = Base::rand(Gecode::Iter::Ranges::size(diff)); removeFromLub(v, i, a, c); } } c.enable(); return same(c); }
unsigned int SetTestSpace::propagators(void) { return Gecode::PropagatorGroup::all.size(*this); }
void SetTestSpace::enable(void) { Gecode::PropagatorGroup::all.enable(*this); }
void SetTestSpace::disable(void) { Gecode::PropagatorGroup::all.disable(*this); (void) status(); }
/// Check the test result and handle failed test#define CHECK_TEST(T,M) \if (opt.log) \ olog << ind(3) << "Check: " << (M) << std::endl; \if (!(T)) { \ problem = (M); delete s; goto failed; \}
/// Start new test#define START_TEST(T) \ if (opt.log) { \ olog.str(""); \ olog << ind(2) << "Testing: " << (T) << std::endl; \ } \ test = (T);
bool SetTest::run(void) { using namespace Gecode; const char* test = "NONE"; const char* problem = "NONE";
SetAssignment* ap = new SetAssignment(arity,lub,withInt); SetAssignment& a = *ap; while (a()) { bool is_sol = solution(a); if (opt.log) olog << ind(1) << "Assignment: " << a << (is_sol ? " (solution)" : " (no solution)") << std::endl; START_TEST("Assignment (after posting)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this); SetTestSpace* sc = nullptr; s->post(); switch (Base::rand(2)) { case 0: if (opt.log) olog << ind(3) << "No copy" << std::endl; sc = s; s = nullptr; break; case 1: if (opt.log) olog << ind(3) << "Copy" << std::endl; if (s->status() != Gecode::SS_FAILED) { sc = static_cast<SetTestSpace*>(s->clone()); } else { sc = s; s = nullptr; } break; default: assert(false); } sc->assign(a); if (is_sol) { CHECK_TEST(!sc->failed(), "Failed on solution"); CHECK_TEST(sc->subsumed(testsubsumed), "No subsumption"); } else { CHECK_TEST(sc->failed(), "Solved on non-solution"); } delete s; delete sc; } START_TEST("Assignment (after posting, disable)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this); s->post(); s->disable(); s->assign(a); s->enable(); if (is_sol) { CHECK_TEST(!s->failed(), "Failed on solution"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } else { CHECK_TEST(s->failed(), "Solved on non-solution"); } delete s; } START_TEST("Assignment (before posting)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this); s->assign(a); s->post(); if (is_sol) { CHECK_TEST(!s->failed(), "Failed on solution"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } else { CHECK_TEST(s->failed(), "Solved on non-solution"); } delete s; } START_TEST("Prune"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this); s->post(); while (!s->failed() && !s->assigned()) if (!s->prune(a)) { problem = "No fixpoint"; delete s; goto failed; } s->assign(a); if (is_sol) { CHECK_TEST(!s->failed(), "Failed on solution"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } else { CHECK_TEST(s->failed(), "Solved on non-solution"); } delete s; } if (disabled) { START_TEST("Prune (disable)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this); SetTestSpace* c = new SetTestSpace(arity,lub,withInt,this); s->post(); c->post(); while (!s->failed() && !s->assigned()) if (!s->disabled(a,*c)) { problem = "Different result after re-enable"; delete s; delete c; goto failed; } s->assign(a); c->assign(a); if (s->failed() != c->failed()) { problem = "Different failure after re-enable"; delete s; delete c; goto failed; } delete s; delete c; } } if (reified) { START_TEST("Assignment reified (rewrite after post, <=>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->post(); s->rel(is_sol); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); delete s; } START_TEST("Assignment reified (rewrite after post, =>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->post(); s->rel(is_sol); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); delete s; } START_TEST("Assignment reified (rewrite after post, <=)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->post(); s->rel(is_sol); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); delete s; } { START_TEST("Assignment reified (rewrite failure, <=>)"); SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->post(); s->rel(!is_sol); s->assign(a); CHECK_TEST(s->failed(), "Not failed"); delete s; } { START_TEST("Assignment reified (rewrite failure, =>)"); SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->post(); s->rel(!is_sol); s->assign(a); if (is_sol) { CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } else { CHECK_TEST(s->failed(), "Not failed"); } delete s; } { START_TEST("Assignment reified (rewrite failure, <=)"); SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->post(); s->rel(!is_sol); s->assign(a); if (is_sol) { CHECK_TEST(s->failed(), "Not failed"); } else { CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } delete s; } START_TEST("Assignment reified (immediate rewrite, <=>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->rel(is_sol); s->post(); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); delete s; } START_TEST("Assignment reified (immediate rewrite, =>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->rel(is_sol); s->post(); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); delete s; } START_TEST("Assignment reified (immediate rewrite, <=)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->rel(is_sol); s->post(); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); delete s; } START_TEST("Assignment reified (immediate failure, <=>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->rel(!is_sol); s->post(); s->assign(a); CHECK_TEST(s->failed(), "Not failed"); delete s; } START_TEST("Assignment reified (immediate failure, =>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->rel(!is_sol); s->post(); s->assign(a); if (is_sol) { CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } else { CHECK_TEST(s->failed(), "Not failed"); } delete s; } START_TEST("Assignment reified (immediate failure, <=)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->rel(!is_sol); s->post(); s->assign(a); if (is_sol) { CHECK_TEST(s->failed(), "Not failed"); } else { CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); } delete s; } START_TEST("Assignment reified (before posting, <=>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->assign(a); s->post(); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); if (is_sol) { CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Assignment reified (before posting, =>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->assign(a); s->post(); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } else { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Assignment reified (before posting, <=)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->assign(a); s->post(); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } delete s; } START_TEST("Assignment reified (after posting, <=>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->post(); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); if (is_sol) { CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Assignment reified (after posting, =>)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->post(); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } else { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Assignment reified (after posting, <=)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->post(); s->assign(a); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } delete s; } START_TEST("Assignment reified (after posting, <=>, disable)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->post(); s->disable(); s->assign(a); s->enable(); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); if (is_sol) { CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Assignment reified (after posting, =>, disable)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->post(); s->disable(); s->assign(a); s->enable(); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } else { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Assignment reified (after posting, <=, disable)"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->post(); s->disable(); s->assign(a); s->enable(); CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } delete s; } START_TEST("Prune reified, <=>"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_EQV); s->post(); while (!s->failed() && (!s->assigned() || !s->r.var().assigned())) if (!s->prune(a)) { problem = "No fixpoint"; delete s; goto failed; } CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); if (is_sol) { CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Prune reified, =>"); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_IMP); s->post(); while (!s->failed() && (!s->assigned() || (!is_sol && !s->r.var().assigned()))) { if (!s->prune(a)) { problem = "No fixpoint"; delete s; goto failed; } } CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } else { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==0, "One on non-solution"); } delete s; } START_TEST("Prune reified, <="); { SetTestSpace* s = new SetTestSpace(arity,lub,withInt,this,RM_PMI); s->post(); while (!s->failed() && (!s->assigned() || (is_sol && !s->r.var().assigned()))) if (!s->prune(a)) { problem = "No fixpoint"; delete s; goto failed; } CHECK_TEST(!s->failed(), "Failed"); CHECK_TEST(s->subsumed(testsubsumed), "No subsumption"); if (is_sol) { CHECK_TEST(s->r.var().assigned(), "Control variable unassigned"); CHECK_TEST(s->r.var().val()==1, "Zero on solution"); } else { CHECK_TEST(!s->r.var().assigned(), "Control variable assigned"); } delete s; } } ++a; } delete ap; return true; failed: if (opt.log) olog << "FAILURE" << std::endl << ind(1) << "Test: " << test << std::endl << ind(1) << "Problem: " << problem << std::endl; if (a() && opt.log) olog << ind(1) << "Assignment: " << a << std::endl; delete ap;
return false; }
const Gecode::SetRelType SetRelTypes::srts[] = {Gecode::SRT_EQ,Gecode::SRT_NQ,Gecode::SRT_SUB, Gecode::SRT_SUP,Gecode::SRT_DISJ,Gecode::SRT_CMPL};
const Gecode::SetOpType SetOpTypes::sots[] = {Gecode::SOT_UNION, Gecode::SOT_DUNION, Gecode::SOT_INTER, Gecode::SOT_MINUS};
}}
#undef START_TEST#undef CHECK_TEST
// STATISTICS: test-set