re-eq.hpp /usr/include/gecode/set/rel.hh /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/rel/re-eq.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> *ChristianSchulte<schulte@gecode.org> * *Bugfixesprovidedby: *GrégoireDooms<dooms@info.ucl.ac.be> * *Copyright: *GuidoTack,2004 *ChristianSchulte,2004 * *Lastmodified: *$Date:2012-10-2201:13:28+0200(Mon,22Oct2012)$by$Author:tack$ *$Revision:13161$ * *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,classCtrlView,ReifyModerm> forceinline ReEq<View0,View1,CtrlView,rm>::ReEq(Homehome,View0y0,View1y1, CtrlViewy2) :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,classCtrlView,ReifyModerm> forceinline ReEq<View0,View1,CtrlView,rm>::ReEq(Space&home,boolshare,ReEq&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,classCtrlView,ReifyModerm> PropCost ReEq<View0,View1,CtrlView,rm>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::ternary(PropCost::LO); } template<classView0,classView1,classCtrlView,ReifyModerm> forceinlinesize_t ReEq<View0,View1,CtrlView,rm>::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,classCtrlView,ReifyModerm> ExecStatus ReEq<View0,View1,CtrlView,rm>::post(Homehome,View0x0,View1x1, CtrlViewb){ (void)new(home)ReEq<View0,View1,CtrlView,rm>(home,x0,x1,b); returnES_OK; } template<classView0,classView1,classCtrlView,ReifyModerm> Actor* ReEq<View0,View1,CtrlView,rm>::copy(Space&home,boolshare){ returnnew(home)ReEq<View0,View1,CtrlView,rm>(home,share,*this); } template<classView0,classView1,classCtrlView,ReifyModerm> ExecStatus ReEq<View0,View1,CtrlView,rm>::propagate(Space&home, constModEventDelta&){ if(b.one()){ if(rm==RM_PMI) returnhome.ES_SUBSUMED(*this); GECODE_REWRITE(*this,(Eq<View0,View1>::post(home(*this),x0,x1))); } if(b.zero()){ if(rm==RM_IMP) returnhome.ES_SUBSUMED(*this); GECODE_REWRITE(*this,(Distinct<View0,View1>::post(home(*this),x0,x1))); } if(x0.assigned()&&x1.assigned()){ //directlytestx0==x1 GlbRanges<View0>x0lb(x0); GlbRanges<View1>x1lb(x1); boolx0eqx1=true; for(;x0lb()&&x1lb();++x0lb,++x1lb){ if(x0lb.min()!=x1lb.min()|| x0lb.max()!=x1lb.max()){ x0eqx1=false; break; } } if(x0eqx1&&!x0lb()&&!x1lb()){ if(rm!=RM_IMP) GECODE_ME_CHECK(b.one_none(home)); returnhome.ES_SUBSUMED(*this); }else{ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); returnhome.ES_SUBSUMED(*this); } } //checkwhethercardinalitiesstillallowequality if(x0.cardMin()>x1.cardMax()|| x1.cardMin()>x0.cardMax()){ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); returnhome.ES_SUBSUMED(*this); } //checkglb(x0)subsetlub(x1) GlbRanges<View0>x0lb(x0); LubRanges<View1>x1ub(x1); Iter::Ranges::Diff<GlbRanges<View0>,LubRanges<View1>>diff1(x0lb,x1ub); if(diff1()){ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); returnhome.ES_SUBSUMED(*this); } //checkglb(x1)subsetlub(x0) GlbRanges<View1>x1lb(x1); LubRanges<View0>x0ub(x0); Iter::Ranges::Diff<GlbRanges<View1>,LubRanges<View0>>diff2(x1lb,x0ub); if(diff2()){ if(rm!=RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); returnhome.ES_SUBSUMED(*this); } returnES_FIX; } }}} //STATISTICS:set-prop