Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
20 kB · 665 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Guido Tack <tack@gecode.org> * * Contributing authors: * Gabor Szokoli <szokoli@gecode.org> * * Copyright: * Guido Tack, 2004, 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 <gecode/set.hh>#include <gecode/set/rel.hh>
namespace Gecode {
void dom(Home home, SetVar s, SetRelType r, int i) { Set::Limits::check(i, "Set::dom"); IntSet d(i,i); dom(home, s, r, d); }
void dom(Home home, const SetVarArgs& s, SetRelType r, int i) { Set::Limits::check(i, "Set::dom"); IntSet d(i,i); dom(home, s, r, d); }
void dom(Home home, SetVar s, SetRelType r, int i, int j) { Set::Limits::check(i, "Set::dom"); Set::Limits::check(j, "Set::dom"); IntSet d(i,j); dom(home, s, r, d); }
void dom(Home home, const SetVarArgs& s, SetRelType r, int i, int j) { Set::Limits::check(i, "Set::dom"); Set::Limits::check(j, "Set::dom"); IntSet d(i,j); dom(home, s, r, d); }
void dom(Home home, SetVar s, SetRelType r, const IntSet& is) { Set::Limits::check(is, "Set::dom"); GECODE_POST;
Set::SetView _s(s);
switch (r) { case SRT_EQ: { if (is.ranges() == 1) { GECODE_ME_FAIL(_s.include(home, is.min(), is.max())); GECODE_ME_FAIL(_s.intersect(home, is.min(), is.max())); } else { IntSetRanges rd1(is); GECODE_ME_FAIL(_s.includeI(home, rd1)); IntSetRanges rd2(is); GECODE_ME_FAIL(_s.intersectI(home, rd2)); } } break; case SRT_LQ: { Set::ConstSetView cv(home, is); GECODE_ES_FAIL( (Set::Rel::Lq<Set::SetView,Set::ConstSetView,false> ::post(home,s,cv))); } break; case SRT_LE: { Set::ConstSetView cv(home, is); GECODE_ES_FAIL( (Set::Rel::Lq<Set::SetView,Set::ConstSetView,true> ::post(home,s,cv))); } break; case SRT_GQ: { Set::ConstSetView cv(home, is); GECODE_ES_FAIL( (Set::Rel::Lq<Set::ConstSetView,Set::SetView,false> ::post(home,cv,s))); } break; case SRT_GR: { Set::ConstSetView cv(home, is); GECODE_ES_FAIL( (Set::Rel::Lq<Set::ConstSetView,Set::SetView,true> ::post(home,cv,s))); } break; case SRT_DISJ: { if (is.ranges() == 1) { GECODE_ME_FAIL(_s.exclude(home, is.min(), is.max())); } else { IntSetRanges rd(is); GECODE_ME_FAIL(_s.excludeI(home, rd)); } } break; case SRT_NQ: { Set::ConstSetView cv(home, is); GECODE_ES_FAIL( (Set::Rel::DistinctDoit<Set::SetView>::post(home, s, cv))); } break; case SRT_SUB: { if (is.ranges() == 1) { GECODE_ME_FAIL(_s.intersect(home, is.min(), is.max())); } else { IntSetRanges rd(is); GECODE_ME_FAIL(_s.intersectI(home, rd)); } } break; case SRT_SUP: { if (is.ranges() == 1) { GECODE_ME_FAIL(_s.include(home, is.min(), is.max())); } else { IntSetRanges rd(is); GECODE_ME_FAIL(_s.includeI(home, rd)); } } break; case SRT_CMPL: { if (is.ranges() == 1) { GECODE_ME_FAIL(_s.exclude(home, is.min(), is.max())); GECODE_ME_FAIL( _s.include(home, Set::Limits::min, is.min()-1) ); GECODE_ME_FAIL( _s.include(home, is.max()+1, Set::Limits::max) ); } else { IntSetRanges rd1(is); Set::RangesCompl<IntSetRanges > rdC1(rd1); GECODE_ME_FAIL(_s.includeI(home, rdC1)); IntSetRanges rd2(is); Set::RangesCompl<IntSetRanges > rdC2(rd2); GECODE_ME_FAIL(_s.intersectI(home, rdC2)); } } break; default: throw Set::UnknownRelation("Set::dom"); } }
void dom(Home home, const SetVarArgs& s, SetRelType r, const IntSet& is) { Set::Limits::check(is, "Set::dom"); GECODE_POST;
switch (r) { case SRT_EQ: { if (is.ranges() == 1) { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ME_FAIL(_s.include(home, is.min(), is.max())); GECODE_ME_FAIL(_s.intersect(home, is.min(), is.max())); } } else { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); IntSetRanges rd1(is); GECODE_ME_FAIL(_s.includeI(home, rd1)); IntSetRanges rd2(is); GECODE_ME_FAIL(_s.intersectI(home, rd2)); } } } break; case SRT_LQ: { Set::ConstSetView cv(home, is); for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ES_FAIL((Set::Rel::Lq<Set::SetView,Set::ConstSetView,false> ::post(home,_s,cv))); } } break; case SRT_LE: { Set::ConstSetView cv(home, is); for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ES_FAIL((Set::Rel::Lq<Set::SetView,Set::ConstSetView,true> ::post(home,_s,cv))); } } break; case SRT_GQ: { Set::ConstSetView cv(home, is); for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ES_FAIL((Set::Rel::Lq<Set::ConstSetView,Set::SetView,false> ::post(home,cv,_s))); } } break; case SRT_GR: { Set::ConstSetView cv(home, is); for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ES_FAIL((Set::Rel::Lq<Set::ConstSetView,Set::SetView,true> ::post(home,cv,_s))); } } break; case SRT_DISJ: { if (is.ranges() == 1) { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ME_FAIL(_s.exclude(home, is.min(), is.max())); } } else { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); IntSetRanges rd(is); GECODE_ME_FAIL(_s.excludeI(home, rd)); } } } break; case SRT_NQ: { Set::ConstSetView cv(home, is); for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ES_FAIL((Set::Rel::DistinctDoit<Set::SetView> ::post(home,_s,cv))); } } break; case SRT_SUB: { if (is.ranges() == 1) { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ME_FAIL(_s.intersect(home, is.min(), is.max())); } } else { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); IntSetRanges rd(is); GECODE_ME_FAIL(_s.intersectI(home, rd)); } } } break; case SRT_SUP: { if (is.ranges() == 1) { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ME_FAIL(_s.include(home, is.min(), is.max())); } } else { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); IntSetRanges rd(is); GECODE_ME_FAIL(_s.includeI(home, rd)); } } } break; case SRT_CMPL: { if (is.ranges() == 1) { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); GECODE_ME_FAIL(_s.exclude(home, is.min(), is.max())); GECODE_ME_FAIL(_s.include(home, Set::Limits::min, is.min()-1) ); GECODE_ME_FAIL(_s.include(home, is.max()+1, Set::Limits::max) ); } } else { for (int i=s.size(); i--; ) { Set::SetView _s(s[i]); IntSetRanges rd1(is); Set::RangesCompl<IntSetRanges > rdC1(rd1); GECODE_ME_FAIL(_s.includeI(home, rdC1)); IntSetRanges rd2(is); Set::RangesCompl<IntSetRanges > rdC2(rd2); GECODE_ME_FAIL(_s.intersectI(home, rdC2)); } } } break; default: throw Set::UnknownRelation("Set::dom"); } }
void dom(Home home, SetVar s, SetRelType rt, int i, Reify r) { Set::Limits::check(i, "Set::dom"); IntSet d(i,i); dom(home, s, rt, d, r); }
void dom(Home home, SetVar s, SetRelType rt, int i, int j, Reify r) { Set::Limits::check(i, "Set::dom"); Set::Limits::check(j, "Set::dom"); IntSet d(i,j); dom(home, s, rt, d, r); }
void dom(Home home, SetVar s, SetRelType rt, const IntSet& is, Reify r) { Set::Limits::check(is, "Set::dom"); GECODE_POST; switch (rt) { case SRT_EQ: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_EQV> ::post(home, s, cv, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_IMP> ::post(home, s, cv, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_PMI> ::post(home, s, cv, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_LQ: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::SetView, Set::ConstSetView,RM_EQV,false>::post(home, s, cv, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::SetView, Set::ConstSetView,RM_IMP,false>::post(home, s, cv, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::SetView, Set::ConstSetView,RM_PMI,false>::post(home, s, cv, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_LE: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::SetView, Set::ConstSetView,RM_EQV,true>::post(home, s, cv, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::SetView, Set::ConstSetView,RM_IMP,true>::post(home, s, cv, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::SetView, Set::ConstSetView,RM_PMI,true>::post(home, s, cv, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_GQ: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::ConstSetView,Set::SetView,RM_EQV,false> ::post(home,cv,s,r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::ConstSetView,Set::SetView,RM_IMP,false> ::post(home,cv,s,r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::ConstSetView,Set::SetView,RM_PMI,false> ::post(home,cv,s,r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_GR: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::ConstSetView,Set::SetView,RM_EQV,true> ::post(home,cv,s,r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::ConstSetView,Set::SetView,RM_IMP,true> ::post(home,cv,s,r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReLq<Set::ConstSetView,Set::SetView,RM_PMI,true> ::post(home,cv,s,r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_NQ: { Gecode::Int::NegBoolView notb(r.var()); Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::NegBoolView,RM_EQV> ::post(home, s, cv, notb))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::NegBoolView,RM_PMI> ::post(home, s, cv, notb))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::NegBoolView,RM_IMP> ::post(home, s, cv, notb))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_SUB: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_EQV> ::post(home, s, cv, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_IMP> ::post(home, s, cv, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_PMI> ::post(home, s, cv, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_SUP: { Set::ConstSetView cv(home, is); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::ConstSetView,Set::SetView, Gecode::Int::BoolView,RM_EQV> ::post(home, cv, s, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::ConstSetView,Set::SetView, Gecode::Int::BoolView,RM_IMP> ::post(home, cv, s, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::ConstSetView,Set::SetView, Gecode::Int::BoolView,RM_PMI> ::post(home, cv, s, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_DISJ: { // x||y <=> b is equivalent to // ( y <= complement(x) and x<=complement(y) ) <=> b
// compute complement of is IntSetRanges dr1(is); Set::RangesCompl<IntSetRanges > dc1(dr1); IntSet dcompl(dc1); Set::ConstSetView cvcompl(home, dcompl); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_EQV> ::post(home, s, cvcompl, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_IMP> ::post(home, s, cvcompl, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReSubset<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_PMI> ::post(home, s, cvcompl, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; case SRT_CMPL: { Set::SetView sv(s);
IntSetRanges dr1(is); Set::RangesCompl<IntSetRanges> dc1(dr1); IntSet dcompl(dc1); Set::ConstSetView cvcompl(home, dcompl);
switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_EQV> ::post(home, s, cvcompl, r.var()))); break; case RM_IMP: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_IMP> ::post(home, s, cvcompl, r.var()))); break; case RM_PMI: GECODE_ES_FAIL( (Set::Rel::ReEq<Set::SetView, Set::ConstSetView,Gecode::Int::BoolView,RM_PMI> ::post(home, s, cvcompl, r.var()))); break; default: throw Gecode::Int::UnknownReifyMode("Set::dom"); } } break; default: throw Set::UnknownRelation("Set::dom"); } }
void dom(Home home, SetVar x, SetVar d) { using namespace Set; GECODE_POST; SetView xv(x), dv(d); if (xv != dv) { GECODE_ME_FAIL(xv.cardMax(home,dv.cardMax())); GECODE_ME_FAIL(xv.cardMin(home,dv.cardMin())); GlbRanges<SetView> lb(dv); GECODE_ME_FAIL(xv.includeI(home,lb)); LubRanges<SetView> ub(dv); GECODE_ME_FAIL(xv.intersectI(home,ub)); } }
void dom(Home home, const SetVarArgs& x, const SetVarArgs& d) { using namespace Set; if (x.size() != d.size()) throw ArgumentSizeMismatch("Set::dom"); for (int i=x.size(); i--; ) { GECODE_POST; SetView xv(x[i]), dv(d[i]); if (xv != dv) { GECODE_ME_FAIL(xv.cardMax(home,dv.cardMax())); GECODE_ME_FAIL(xv.cardMin(home,dv.cardMin())); GlbRanges<SetView> lb(dv); GECODE_ME_FAIL(xv.includeI(home,lb)); LubRanges<SetView> ub(dv); GECODE_ME_FAIL(xv.intersectI(home,ub)); } } }
}
// STATISTICS: set-post