re-lq.hpp /usr/include/gecode/set/rel.hh /usr/include/gecode/set/rel/re-lq.hpp /usr/include/gecode/set/channel.hh /usr/include/gecode/set/rel.hh /usr/include/gecode/set/element.hh /usr/include/gecode/set/rel-op.hh /usr/include/gecode/set/channel/sorted.hpp /usr/include/gecode/set/sequence.hh /usr/include/gecode/set/rel-op/post.hpp Gecode Gecode::Set Gecode::Set::Rel /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> * *Copyright: *GuidoTack,2011 * *Lastmodified: *$Date:2012-10-1905:58:26+0200(Fri,19Oct2012)$by$Author:tack$ *$Revision:13156$ * *ThisfileispartofGecode,thegenericconstraint *developmentenvironment: *http://www.gecode.org * *Permissionisherebygranted,freeofcharge,toanypersonobtaining *acopyofthissoftwareandassociateddocumentationfiles(the *"Software"),todealintheSoftwarewithoutrestriction,including *withoutlimitationtherightstouse,copy,modify,merge,publish, *distribute,sublicense,and/orsellcopiesoftheSoftware,andto *permitpersonstowhomtheSoftwareisfurnishedtodoso,subjectto *thefollowingconditions: * *Theabovecopyrightnoticeandthispermissionnoticeshallbe *includedinallcopiesorsubstantialportionsoftheSoftware. * *THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND, *EXPRESSORIMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOF *MERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEAND *NONINFRINGEMENT.INNOEVENTSHALLTHEAUTHORSORCOPYRIGHTHOLDERSBE *LIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITY,WHETHERINANACTION *OFCONTRACT,TORTOROTHERWISE,ARISINGFROM,OUTOFORINCONNECTION *WITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE. * */ namespaceGecode{namespaceSet{namespaceRel{ template<classView0,classView1,ReifyModerm,boolstrict> forceinline ReLq<View0,View1,rm,strict>::ReLq(Homehome,View0y0,View1y1, Gecode::Int::BoolViewy2) :Propagator(home),x0(y0),x1(y1),b(y2){ b.subscribe(home,*this,Gecode::Int::PC_INT_VAL); x0.subscribe(home,*this,PC_SET_ANY); x1.subscribe(home,*this,PC_SET_ANY); } template<classView0,classView1,ReifyModerm,boolstrict> forceinline ReLq<View0,View1,rm,strict>::ReLq(Space&home,boolshare,ReLq&p) :Propagator(home,share,p){ x0.update(home,share,p.x0); x1.update(home,share,p.x1); b.update(home,share,p.b); } template<classView0,classView1,ReifyModerm,boolstrict> PropCost ReLq<View0,View1,rm,strict>::cost(constSpace&,constModEventDelta&)const { returnPropCost::ternary(PropCost::LO); } template<classView0,classView1,ReifyModerm,boolstrict> forceinlinesize_t ReLq<View0,View1,rm,strict>::dispose(Space&home){ b.cancel(home,*this,Gecode::Int::PC_INT_VAL); x0.cancel(home,*this,PC_SET_ANY); x1.cancel(home,*this,PC_SET_ANY); (void)Propagator::dispose(home); returnsizeof(*this); } template<classView0,classView1,ReifyModerm,boolstrict> ExecStatus ReLq<View0,View1,rm,strict>::post(Homehome,View0x0,View1x1, Gecode::Int::BoolViewb){ (void)new(home)ReLq<View0,View1,rm,strict>(home,x0,x1,b); returnES_OK; } template<classView0,classView1,ReifyModerm,boolstrict> Actor* ReLq<View0,View1,rm,strict>::copy(Space&home,boolshare){ returnnew(home)ReLq<View0,View1,rm,strict>(home,share,*this); } template<classView0,classView1,ReifyModerm,boolstrict> ExecStatus ReLq<View0,View1,rm,strict>::propagate(Space&home,constModEventDelta&){ if(b.one()){ if(rm==RM_PMI) returnhome.ES_SUBSUMED(*this); GECODE_REWRITE(*this,(Lq<View0,View1,strict>::post(home(*this),x0,x1))); } if(b.zero()){ if(rm==RM_IMP) returnhome.ES_SUBSUMED(*this); GECODE_REWRITE(*this, (Lq<View1,View0,!strict>::post(home(*this),x1,x0))); } if(x0.cardMax()==0){ if((!strict)||x1.cardMin()>0){ if(rm!=RM_IMP) GECODE_ME_CHECK(b.one_none(home)); returnhome.ES_SUBSUMED(*this); } if(strict&&x1.cardMax()==0){ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); returnhome.ES_SUBSUMED(*this); } } if(x0.assigned()&&x1.assigned()){ //directlytestx0<=x1 intmin01; { GlbRanges<View0>x0l(x0); GlbRanges<View1>x1l(x1); Iter::Ranges::Diff<GlbRanges<View1>,GlbRanges<View0>>d(x1l,x0l); if(!d()){ if((!strict)&&x0.cardMax()==x1.cardMax()){ //equal if(rm!=RM_IMP) GECODE_ME_CHECK(b.one_none(home)); }else{ //subset if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); } returnhome.ES_SUBSUMED(*this); } min01=d.min(); } intmin10; { GlbRanges<View0>x0l(x0); GlbRanges<View1>x1l(x1); Iter::Ranges::Diff<GlbRanges<View0>,GlbRanges<View1>>d(x0l,x1l); if(!d()){ if(strict&&x0.cardMax()==x1.cardMax()){ //equal if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); }else{ //subset if(rm!=RM_IMP) GECODE_ME_CHECK(b.one_none(home)); } returnhome.ES_SUBSUMED(*this); } min10=d.min(); } assert(min01!=min10); if(min01<min10){ if(rm!=RM_IMP) GECODE_ME_CHECK(b.one_none(home)); }else{ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); } returnhome.ES_SUBSUMED(*this); } //min(x0lb-x1ub)<min(x1ub)->b=0 if(x1.cardMax()>0){ GlbRanges<View0>x0l(x0); LubRanges<View1>x1u(x1); intx1umin=x1u.min(); Iter::Ranges::Diff<GlbRanges<View0>,LubRanges<View1>>d(x0l,x1u); if(d()&&d.min()<x1umin){ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); returnhome.ES_SUBSUMED(*this); } } //min(x1lb-x0ub)<min(x0ub)->b=1 if(x0.cardMax()>0){ LubRanges<View0>x0u(x0); GlbRanges<View1>x1l(x1); intx0umin=x0u.min(); Iter::Ranges::Diff<GlbRanges<View1>,LubRanges<View0>>d(x1l,x0u); if(d()&&d.min()<x0umin){ if(rm!=RM_IMP) GECODE_ME_CHECK(b.one_none(home)); returnhome.ES_SUBSUMED(*this); } } returnES_FIX; } }}} //STATISTICS:set-prop