or.hpp /usr/include/gecode/int/bool.hh /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/int/bool/or.hpp /usr/include/gecode/int/bool.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/linear/bool-int.hpp /usr/include/gecode/int/gcc.hh /usr/include/gecode/int/nvalues/bool-eq.hpp /usr/include/gecode/int/nvalues/bool-lq.hpp /usr/include/gecode/int/arithmetic/divmod.hpp /usr/include/gecode/int/linear.hh Gecode::Int::Bool::OrTrueSubsumed Gecode Gecode::Int Gecode::Int::Bool GECODE_INT_STATUS S0 S1 ((BVA::S0<<(1*BVA::BITS))|(BVB::S1<<(0*BVB::BITS))) GECODE_INT_STATUS S0 S1 S2 ((BV::S0<<(2*BV::BITS))|(BV::S1<<(1*BV::BITS))|(BV::S2<<(0*BV::BITS))) GECODE_INT_STATUS S0 S1 S2 S3 ((BV::S0 << (3*BV::BITS)) | (BV::S1 << (2*BV::BITS)) | \ (BV::S2 << (1*BV::BITS)) | (BV::S3 << (0*BV::BITS))) GECODE_INT_STATUS S0 S1 S2 ((BVA::S0<<(2*BVA::BITS))|(BVB::S1<<(1*BVB::BITS))|(BVC::S2<<(0*BVC::BITS))) /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2004 * *Lastmodified: *$Date:2012-09-1011:31:52+0200(Mon,10Sep2012)$by$Author:schulte$ *$Revision:13071$ * *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{namespaceInt{namespaceBool{ template<classBV> classOrTrueSubsumed:publicBoolBinary<BV,BV>{ protected: usingBoolBinary<BV,BV>::x0; usingBoolBinary<BV,BV>::x1; OrTrueSubsumed(Space&home,boolshare,OrTrueSubsumed&p); staticExecStatuspost(Homehome,BVb0,BVb1); public: OrTrueSubsumed(Homehome,BVb0,BVb1); OrTrueSubsumed(Space&home,boolshare,Propagator&p, BVb0,BVb1); virtualActor*copy(Space&home,boolshare); virtualExecStatuspropagate(Space&home,constModEventDelta&med); }; template<classBV> forceinline OrTrueSubsumed<BV>::OrTrueSubsumed (Homehome,BVb0,BVb1) :BoolBinary<BV,BV>(home,b0,b1){} template<classBV> forceinlineExecStatus OrTrueSubsumed<BV>::post(Homehome,BVb0,BVb1){ (void)new(home)OrTrueSubsumed(home,b0,b1); returnES_OK; } template<classBV> forceinline OrTrueSubsumed<BV>::OrTrueSubsumed (Space&home,boolshare,OrTrueSubsumed<BV>&p) :BoolBinary<BV,BV>(home,share,p){} template<classBV> forceinline OrTrueSubsumed<BV>::OrTrueSubsumed(Space&home,boolshare,Propagator&p, BVb0,BVb1) :BoolBinary<BV,BV>(home,share,p,b0,b1){} template<classBV> Actor* OrTrueSubsumed<BV>::copy(Space&home,boolshare){ returnnew(home)OrTrueSubsumed<BV>(home,share,*this); } template<classBV> ExecStatus OrTrueSubsumed<BV>::propagate(Space&home,constModEventDelta&){ returnhome.ES_SUBSUMED(*this); } /* *BinaryBooleandisjunctionpropagator(true) * */ template<classBVA,classBVB> forceinline BinOrTrue<BVA,BVB>::BinOrTrue(Homehome,BVAb0,BVBb1) :BoolBinary<BVA,BVB>(home,b0,b1){} template<classBVA,classBVB> forceinline BinOrTrue<BVA,BVB>::BinOrTrue(Space&home,boolshare,BinOrTrue<BVA,BVB>&p) :BoolBinary<BVA,BVB>(home,share,p){} template<classBVA,classBVB> forceinline BinOrTrue<BVA,BVB>::BinOrTrue(Space&home,boolshare,Propagator&p, BVAb0,BVBb1) :BoolBinary<BVA,BVB>(home,share,p,b0,b1){} template<classBVA,classBVB> Actor* BinOrTrue<BVA,BVB>::copy(Space&home,boolshare){ returnnew(home)BinOrTrue<BVA,BVB>(home,share,*this); } template<classBVA,classBVB> inlineExecStatus BinOrTrue<BVA,BVB>::post(Homehome,BVAb0,BVBb1){ switch(bool_test(b0,b1)){ caseBT_SAME: GECODE_ME_CHECK(b0.one(home)); break; caseBT_COMP: break; caseBT_NONE: if(b0.zero()){ GECODE_ME_CHECK(b1.one(home)); }elseif(b1.zero()){ GECODE_ME_CHECK(b0.one(home)); }elseif(!b0.one()&&!b1.one()){ (void)new(home)BinOrTrue<BVA,BVB>(home,b0,b1); } break; default:GECODE_NEVER; } returnES_OK; } template<classBVA,classBVB> ExecStatus BinOrTrue<BVA,BVB>::propagate(Space&home,constModEventDelta&){ #defineGECODE_INT_STATUS(S0,S1)\ ((BVA::S0<<(1*BVA::BITS))|(BVB::S1<<(0*BVB::BITS))) switch((x0.status()<<(1*BVA::BITS))|(x1.status()<<(0*BVB::BITS))){ caseGECODE_INT_STATUS(NONE,NONE): GECODE_NEVER; caseGECODE_INT_STATUS(NONE,ZERO): GECODE_ME_CHECK(x0.one_none(home));break; caseGECODE_INT_STATUS(NONE,ONE): break; caseGECODE_INT_STATUS(ZERO,NONE): GECODE_ME_CHECK(x1.one_none(home));break; caseGECODE_INT_STATUS(ZERO,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ZERO,ONE): caseGECODE_INT_STATUS(ONE,NONE): caseGECODE_INT_STATUS(ONE,ZERO): caseGECODE_INT_STATUS(ONE,ONE): break; default: GECODE_NEVER; } returnhome.ES_SUBSUMED(*this); #undefGECODE_INT_STATUS } /* *Booleandisjunctionpropagator(true) * */ template<classBV> forceinline TerOrTrue<BV>::TerOrTrue(Homehome,BVb0,BVb1,BVb2) :BoolBinary<BV,BV>(home,b0,b1),x2(b2){} template<classBV> forceinlinesize_t TerOrTrue<BV>::dispose(Space&home){ (void)BoolBinary<BV,BV>::dispose(home); returnsizeof(*this); } template<classBV> forceinline TerOrTrue<BV>::TerOrTrue(Space&home,boolshare,TerOrTrue<BV>&p) :BoolBinary<BV,BV>(home,share,p){ x2.update(home,share,p.x2); } template<classBV> forceinline TerOrTrue<BV>::TerOrTrue(Space&home,boolshare,Propagator&p, BVb0,BVb1,BVb2) :BoolBinary<BV,BV>(home,share,p,b0,b1){ x2.update(home,share,b2); } template<classBV> Actor* TerOrTrue<BV>::copy(Space&home,boolshare){ assert(x0.none()&&x1.none()); if(x2.one()) returnnew(home)OrTrueSubsumed<BV>(home,share,*this,x0,x1); elseif(x2.zero()) returnnew(home)BinOrTrue<BV,BV>(home,share,*this,x0,x1); else returnnew(home)TerOrTrue<BV>(home,share,*this); } template<classBV> forceinlineExecStatus TerOrTrue<BV>::post(Homehome,BVb0,BVb1,BVb2){ (void)new(home)TerOrTrue<BV>(home,b0,b1,b2); returnES_OK; } template<classBV> ExecStatus TerOrTrue<BV>::propagate(Space&home,constModEventDelta&){ #defineGECODE_INT_STATUS(S0,S1,S2)\ ((BV::S0<<(2*BV::BITS))|(BV::S1<<(1*BV::BITS))|(BV::S2<<(0*BV::BITS))) switch((x0.status()<<(2*BV::BITS))|(x1.status()<<(1*BV::BITS))| (x2.status()<<(0*BV::BITS))){ caseGECODE_INT_STATUS(NONE,NONE,NONE): caseGECODE_INT_STATUS(NONE,NONE,ZERO): caseGECODE_INT_STATUS(NONE,NONE,ONE): GECODE_NEVER; caseGECODE_INT_STATUS(NONE,ZERO,NONE): std::swap(x1,x2);x1.subscribe(home,*this,PC_BOOL_VAL); returnES_FIX; caseGECODE_INT_STATUS(NONE,ZERO,ZERO): GECODE_ME_CHECK(x0.one_none(home));break; caseGECODE_INT_STATUS(NONE,ZERO,ONE): caseGECODE_INT_STATUS(NONE,ONE,NONE): caseGECODE_INT_STATUS(NONE,ONE,ZERO): caseGECODE_INT_STATUS(NONE,ONE,ONE): break; caseGECODE_INT_STATUS(ZERO,NONE,NONE): std::swap(x0,x2);x0.subscribe(home,*this,PC_BOOL_VAL); returnES_FIX; caseGECODE_INT_STATUS(ZERO,NONE,ZERO): GECODE_ME_CHECK(x1.one_none(home));break; caseGECODE_INT_STATUS(ZERO,NONE,ONE): break; caseGECODE_INT_STATUS(ZERO,ZERO,NONE): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(ZERO,ZERO,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ZERO,ZERO,ONE): caseGECODE_INT_STATUS(ZERO,ONE,NONE): caseGECODE_INT_STATUS(ZERO,ONE,ZERO): caseGECODE_INT_STATUS(ZERO,ONE,ONE): caseGECODE_INT_STATUS(ONE,NONE,NONE): caseGECODE_INT_STATUS(ONE,NONE,ZERO): caseGECODE_INT_STATUS(ONE,NONE,ONE): caseGECODE_INT_STATUS(ONE,ZERO,NONE): caseGECODE_INT_STATUS(ONE,ZERO,ZERO): caseGECODE_INT_STATUS(ONE,ZERO,ONE): caseGECODE_INT_STATUS(ONE,ONE,NONE): caseGECODE_INT_STATUS(ONE,ONE,ZERO): caseGECODE_INT_STATUS(ONE,ONE,ONE): break; default: GECODE_NEVER; } returnhome.ES_SUBSUMED(*this); #undefGECODE_INT_STATUS } /* *Booleandisjunctionpropagator(true) * */ template<classBV> forceinline QuadOrTrue<BV>::QuadOrTrue(Homehome,BVb0,BVb1,BVb2,BVb3) :BoolBinary<BV,BV>(home,b0,b1),x2(b2),x3(b3){} template<classBV> forceinlinesize_t QuadOrTrue<BV>::dispose(Space&home){ (void)BoolBinary<BV,BV>::dispose(home); returnsizeof(*this); } template<classBV> forceinline QuadOrTrue<BV>::QuadOrTrue(Space&home,boolshare,QuadOrTrue<BV>&p) :BoolBinary<BV,BV>(home,share,p){ x2.update(home,share,p.x2); x3.update(home,share,p.x3); } template<classBV> forceinline QuadOrTrue<BV>::QuadOrTrue(Space&home,boolshare,Propagator&p, BVb0,BVb1,BVb2,BVb3) :BoolBinary<BV,BV>(home,share,p,b0,b1){ x2.update(home,share,b2); x3.update(home,share,b3); } template<classBV> Actor* QuadOrTrue<BV>::copy(Space&home,boolshare){ assert(x0.none()&&x1.none()); if(x2.one()||x3.one()) returnnew(home)OrTrueSubsumed<BV>(home,share,*this,x0,x1); elseif(x2.zero()&&x3.zero()) returnnew(home)BinOrTrue<BV,BV>(home,share,*this,x0,x1); elseif(x2.zero()) returnnew(home)TerOrTrue<BV>(home,share,*this,x0,x1,x3); elseif(x3.zero()) returnnew(home)TerOrTrue<BV>(home,share,*this,x0,x1,x2); else returnnew(home)QuadOrTrue<BV>(home,share,*this); } template<classBV> forceinlineExecStatus QuadOrTrue<BV>::post(Homehome,BVb0,BVb1,BVb2,BVb3){ (void)new(home)QuadOrTrue<BV>(home,b0,b1,b2,b3); returnES_OK; } template<classBV> ExecStatus QuadOrTrue<BV>::propagate(Space&home,constModEventDelta&){ #defineGECODE_INT_STATUS(S0,S1,S2,S3)\ ((BV::S0<<(3*BV::BITS))|(BV::S1<<(2*BV::BITS))|\ (BV::S2<<(1*BV::BITS))|(BV::S3<<(0*BV::BITS))) switch((x0.status()<<(3*BV::BITS))|(x1.status()<<(2*BV::BITS))| (x2.status()<<(1*BV::BITS))|(x3.status()<<(0*BV::BITS))){ caseGECODE_INT_STATUS(NONE,NONE,NONE,NONE): caseGECODE_INT_STATUS(NONE,NONE,NONE,ZERO): caseGECODE_INT_STATUS(NONE,NONE,NONE,ONE): caseGECODE_INT_STATUS(NONE,NONE,ZERO,NONE): caseGECODE_INT_STATUS(NONE,NONE,ZERO,ZERO): caseGECODE_INT_STATUS(NONE,NONE,ZERO,ONE): caseGECODE_INT_STATUS(NONE,NONE,ONE,NONE): caseGECODE_INT_STATUS(NONE,NONE,ONE,ZERO): caseGECODE_INT_STATUS(NONE,NONE,ONE,ONE): GECODE_NEVER; caseGECODE_INT_STATUS(NONE,ZERO,NONE,NONE): caseGECODE_INT_STATUS(NONE,ZERO,NONE,ZERO): std::swap(x1,x2);x1.subscribe(home,*this,PC_BOOL_VAL,false); returnES_FIX; caseGECODE_INT_STATUS(NONE,ZERO,NONE,ONE): break; caseGECODE_INT_STATUS(NONE,ZERO,ZERO,NONE): std::swap(x1,x3);x1.subscribe(home,*this,PC_BOOL_VAL,false); returnES_FIX; caseGECODE_INT_STATUS(NONE,ZERO,ZERO,ZERO): GECODE_ME_CHECK(x0.one_none(home));break; caseGECODE_INT_STATUS(NONE,ZERO,ZERO,ONE): caseGECODE_INT_STATUS(NONE,ZERO,ONE,NONE): caseGECODE_INT_STATUS(NONE,ZERO,ONE,ZERO): caseGECODE_INT_STATUS(NONE,ZERO,ONE,ONE): caseGECODE_INT_STATUS(NONE,ONE,NONE,NONE): caseGECODE_INT_STATUS(NONE,ONE,NONE,ZERO): caseGECODE_INT_STATUS(NONE,ONE,NONE,ONE): caseGECODE_INT_STATUS(NONE,ONE,ZERO,NONE): caseGECODE_INT_STATUS(NONE,ONE,ZERO,ZERO): caseGECODE_INT_STATUS(NONE,ONE,ZERO,ONE): caseGECODE_INT_STATUS(NONE,ONE,ONE,NONE): caseGECODE_INT_STATUS(NONE,ONE,ONE,ZERO): caseGECODE_INT_STATUS(NONE,ONE,ONE,ONE): break; caseGECODE_INT_STATUS(ZERO,NONE,NONE,NONE): caseGECODE_INT_STATUS(ZERO,NONE,NONE,ZERO): std::swap(x0,x2);x0.subscribe(home,*this,PC_BOOL_VAL,false); returnES_FIX; caseGECODE_INT_STATUS(ZERO,NONE,NONE,ONE): break; caseGECODE_INT_STATUS(ZERO,NONE,ZERO,NONE): std::swap(x0,x3);x0.subscribe(home,*this,PC_BOOL_VAL,false); returnES_FIX; caseGECODE_INT_STATUS(ZERO,NONE,ZERO,ZERO): GECODE_ME_CHECK(x1.one_none(home));break; caseGECODE_INT_STATUS(ZERO,NONE,ZERO,ONE): caseGECODE_INT_STATUS(ZERO,NONE,ONE,NONE): caseGECODE_INT_STATUS(ZERO,NONE,ONE,ZERO): caseGECODE_INT_STATUS(ZERO,NONE,ONE,ONE): break; caseGECODE_INT_STATUS(ZERO,ZERO,NONE,NONE): std::swap(x0,x2);x0.subscribe(home,*this,PC_BOOL_VAL,false); std::swap(x1,x3);x1.subscribe(home,*this,PC_BOOL_VAL,false); returnES_FIX; caseGECODE_INT_STATUS(ZERO,ZERO,NONE,ZERO): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(ZERO,ZERO,NONE,ONE): break; caseGECODE_INT_STATUS(ZERO,ZERO,ZERO,NONE): GECODE_ME_CHECK(x3.one_none(home));break; caseGECODE_INT_STATUS(ZERO,ZERO,ZERO,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ZERO,ZERO,ZERO,ONE): caseGECODE_INT_STATUS(ZERO,ZERO,ONE,NONE): caseGECODE_INT_STATUS(ZERO,ZERO,ONE,ZERO): caseGECODE_INT_STATUS(ZERO,ZERO,ONE,ONE): caseGECODE_INT_STATUS(ZERO,ONE,NONE,NONE): caseGECODE_INT_STATUS(ZERO,ONE,NONE,ZERO): caseGECODE_INT_STATUS(ZERO,ONE,NONE,ONE): caseGECODE_INT_STATUS(ZERO,ONE,ZERO,NONE): caseGECODE_INT_STATUS(ZERO,ONE,ZERO,ZERO): caseGECODE_INT_STATUS(ZERO,ONE,ZERO,ONE): caseGECODE_INT_STATUS(ZERO,ONE,ONE,NONE): caseGECODE_INT_STATUS(ZERO,ONE,ONE,ZERO): caseGECODE_INT_STATUS(ZERO,ONE,ONE,ONE): caseGECODE_INT_STATUS(ONE,NONE,NONE,NONE): caseGECODE_INT_STATUS(ONE,NONE,NONE,ZERO): caseGECODE_INT_STATUS(ONE,NONE,NONE,ONE): caseGECODE_INT_STATUS(ONE,NONE,ZERO,NONE): caseGECODE_INT_STATUS(ONE,NONE,ZERO,ZERO): caseGECODE_INT_STATUS(ONE,NONE,ZERO,ONE): caseGECODE_INT_STATUS(ONE,NONE,ONE,NONE): caseGECODE_INT_STATUS(ONE,NONE,ONE,ZERO): caseGECODE_INT_STATUS(ONE,NONE,ONE,ONE): caseGECODE_INT_STATUS(ONE,ZERO,NONE,NONE): caseGECODE_INT_STATUS(ONE,ZERO,NONE,ZERO): caseGECODE_INT_STATUS(ONE,ZERO,NONE,ONE): caseGECODE_INT_STATUS(ONE,ZERO,ZERO,NONE): caseGECODE_INT_STATUS(ONE,ZERO,ZERO,ZERO): caseGECODE_INT_STATUS(ONE,ZERO,ZERO,ONE): caseGECODE_INT_STATUS(ONE,ZERO,ONE,NONE): caseGECODE_INT_STATUS(ONE,ZERO,ONE,ZERO): caseGECODE_INT_STATUS(ONE,ZERO,ONE,ONE): caseGECODE_INT_STATUS(ONE,ONE,NONE,NONE): caseGECODE_INT_STATUS(ONE,ONE,NONE,ZERO): caseGECODE_INT_STATUS(ONE,ONE,NONE,ONE): caseGECODE_INT_STATUS(ONE,ONE,ZERO,NONE): caseGECODE_INT_STATUS(ONE,ONE,ZERO,ZERO): caseGECODE_INT_STATUS(ONE,ONE,ZERO,ONE): caseGECODE_INT_STATUS(ONE,ONE,ONE,NONE): caseGECODE_INT_STATUS(ONE,ONE,ONE,ZERO): caseGECODE_INT_STATUS(ONE,ONE,ONE,ONE): break; default: GECODE_NEVER; } returnhome.ES_SUBSUMED(*this); #undefGECODE_INT_STATUS } /* *Booleandisjunctionpropagator * */ template<classBVA,classBVB,classBVC> forceinline Or<BVA,BVB,BVC>::Or(Homehome,BVAb0,BVBb1,BVCb2) :BoolTernary<BVA,BVB,BVC>(home,b0,b1,b2){} template<classBVA,classBVB,classBVC> forceinline Or<BVA,BVB,BVC>::Or(Space&home,boolshare,Or<BVA,BVB,BVC>&p) :BoolTernary<BVA,BVB,BVC>(home,share,p){} template<classBVA,classBVB,classBVC> forceinline Or<BVA,BVB,BVC>::Or(Space&home,boolshare,Propagator&p, BVAb0,BVBb1,BVCb2) :BoolTernary<BVA,BVB,BVC>(home,share,p,b0,b1,b2){} template<classBVA,classBVB,classBVC> Actor* Or<BVA,BVB,BVC>::copy(Space&home,boolshare){ if(x2.one()){ assert(x0.none()&&x1.none()); returnnew(home)BinOrTrue<BVA,BVB>(home,share,*this,x0,x1); }elseif(x0.zero()){ assert(x1.none()&&x2.none()); returnnew(home)Eq<BVB,BVC>(home,share,*this,x1,x2); }elseif(x1.zero()){ assert(x0.none()&&x2.none()); returnnew(home)Eq<BVA,BVC>(home,share,*this,x0,x2); }else{ returnnew(home)Or<BVA,BVB,BVC>(home,share,*this); } } template<classBVA,classBVB,classBVC> inlineExecStatus Or<BVA,BVB,BVC>::post(Homehome,BVAb0,BVBb1,BVCb2){ if(b2.zero()){ GECODE_ME_CHECK(b0.zero(home)); GECODE_ME_CHECK(b1.zero(home)); }elseif(b2.one()){ returnBinOrTrue<BVA,BVB>::post(home,b0,b1); }else{ switch(bool_test(b0,b1)){ caseBT_SAME: returnEq<BVA,BVC>::post(home,b0,b2); caseBT_COMP: GECODE_ME_CHECK(b2.one(home)); break; caseBT_NONE: if(b0.one()||b1.one()){ GECODE_ME_CHECK(b2.one(home)); }elseif(b0.zero()){ returnEq<BVB,BVC>::post(home,b1,b2); }elseif(b1.zero()){ returnEq<BVA,BVC>::post(home,b0,b2); }else{ (void)new(home)Or<BVA,BVB,BVC>(home,b0,b1,b2); } break; default:GECODE_NEVER; } } returnES_OK; } template<classBVA,classBVB,classBVC> ExecStatus Or<BVA,BVB,BVC>::propagate(Space&home,constModEventDelta&){ #defineGECODE_INT_STATUS(S0,S1,S2)\ ((BVA::S0<<(2*BVA::BITS))|(BVB::S1<<(1*BVB::BITS))|(BVC::S2<<(0*BVC::BITS))) switch((x0.status()<<(2*BVA::BITS))|(x1.status()<<(1*BVB::BITS))| (x2.status()<<(0*BVC::BITS))){ caseGECODE_INT_STATUS(NONE,NONE,NONE): GECODE_NEVER; caseGECODE_INT_STATUS(NONE,NONE,ZERO): GECODE_ME_CHECK(x0.zero_none(home)); GECODE_ME_CHECK(x1.zero_none(home)); break; caseGECODE_INT_STATUS(NONE,NONE,ONE): returnES_FIX; caseGECODE_INT_STATUS(NONE,ZERO,NONE): switch(bool_test(x0,x2)){ caseBT_SAME:returnhome.ES_SUBSUMED(*this); caseBT_COMP:returnES_FAILED; caseBT_NONE:returnES_FIX; default:GECODE_NEVER; } GECODE_NEVER; caseGECODE_INT_STATUS(NONE,ZERO,ZERO): GECODE_ME_CHECK(x0.zero_none(home));break; caseGECODE_INT_STATUS(NONE,ZERO,ONE): GECODE_ME_CHECK(x0.one_none(home));break; caseGECODE_INT_STATUS(NONE,ONE,NONE): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(NONE,ONE,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(NONE,ONE,ONE): break; caseGECODE_INT_STATUS(ZERO,NONE,NONE): switch(bool_test(x1,x2)){ caseBT_SAME:returnhome.ES_SUBSUMED(*this); caseBT_COMP:returnES_FAILED; caseBT_NONE:returnES_FIX; default:GECODE_NEVER; } GECODE_NEVER; caseGECODE_INT_STATUS(ZERO,NONE,ZERO): GECODE_ME_CHECK(x1.zero_none(home));break; caseGECODE_INT_STATUS(ZERO,NONE,ONE): GECODE_ME_CHECK(x1.one_none(home));break; caseGECODE_INT_STATUS(ZERO,ZERO,NONE): GECODE_ME_CHECK(x2.zero_none(home));break; caseGECODE_INT_STATUS(ZERO,ZERO,ZERO): break; caseGECODE_INT_STATUS(ZERO,ZERO,ONE): returnES_FAILED; caseGECODE_INT_STATUS(ZERO,ONE,NONE): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(ZERO,ONE,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ZERO,ONE,ONE): break; caseGECODE_INT_STATUS(ONE,NONE,NONE): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(ONE,NONE,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ONE,NONE,ONE): break; caseGECODE_INT_STATUS(ONE,ZERO,NONE): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(ONE,ZERO,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ONE,ZERO,ONE): break; caseGECODE_INT_STATUS(ONE,ONE,NONE): GECODE_ME_CHECK(x2.one_none(home));break; caseGECODE_INT_STATUS(ONE,ONE,ZERO): returnES_FAILED; caseGECODE_INT_STATUS(ONE,ONE,ONE): break; default: GECODE_NEVER; } returnhome.ES_SUBSUMED(*this); #undefGECODE_INT_STATUS } /* *N-aryBooleandisjunctionpropagator(true) * */ template<classBV> forceinline NaryOrTrue<BV>::NaryOrTrue(Homehome,ViewArray<BV>&b) :BinaryPropagator<BV,PC_BOOL_VAL>(home,b[0],b[1]),x(b){ assert(x.size()>2); x.drop_fst(2); } template<classBV> PropCost NaryOrTrue<BV>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::binary(PropCost::LO); } template<classBV> forceinline NaryOrTrue<BV>::NaryOrTrue(Space&home,boolshare,NaryOrTrue<BV>&p) :BinaryPropagator<BV,PC_BOOL_VAL>(home,share,p){ x.update(home,share,p.x); } template<classBV> Actor* NaryOrTrue<BV>::copy(Space&home,boolshare){ intn=x.size(); if(n>0){ //Eliminateallzerosandfindaone for(inti=n;i--;) if(x[i].one()){ //Onlykeeptheone x[0]=x[i];x.size(1); returnnew(home)OrTrueSubsumed<BV>(home,share,*this,x0,x1); }elseif(x[i].zero()){ //Eliminatethezero x[i]=x[--n]; } x.size(n); } switch(n){ case0: returnnew(home)BinOrTrue<BV,BV>(home,share,*this,x0,x1); case1: returnnew(home)TerOrTrue<BV>(home,share,*this,x0,x1,x[0]); case2: returnnew(home)QuadOrTrue<BV>(home,share,*this,x0,x1,x[0],x[1]); default: returnnew(home)NaryOrTrue<BV>(home,share,*this); } } template<classBV> inlineExecStatus NaryOrTrue<BV>::post(Homehome,ViewArray<BV>&b){ for(inti=b.size();i--;) if(b[i].one()) returnES_OK; elseif(b[i].zero()) b.move_lst(i); if(b.size()==0) returnES_FAILED; if(b.size()==1){ GECODE_ME_CHECK(b[0].one(home)); }elseif(b.size()==2){ returnBinOrTrue<BV,BV>::post(home,b[0],b[1]); }elseif(b.size()==3){ returnTerOrTrue<BV>::post(home,b[0],b[1],b[2]); }elseif(b.size()==4){ returnQuadOrTrue<BV>::post(home,b[0],b[1],b[2],b[3]); }else{ (void)new(home)NaryOrTrue(home,b); } returnES_OK; } template<classBV> forceinlinesize_t NaryOrTrue<BV>::dispose(Space&home){ (void)BinaryPropagator<BV,PC_BOOL_VAL>::dispose(home); returnsizeof(*this); } template<classBV> forceinlineExecStatus NaryOrTrue<BV>::resubscribe(Space&home,BV&x0,BVx1){ if(x0.zero()){ intn=x.size(); for(inti=n;i--;) if(x[i].one()){ returnhome.ES_SUBSUMED(*this); }elseif(x[i].zero()){ x[i]=x[--n]; }else{ //Movetox0andsubscribe x0=x[i];x[i]=x[--n]; x.size(n); x0.subscribe(home,*this,PC_BOOL_VAL,false); returnES_FIX; } //Allviewshavebeenassigned! GECODE_ME_CHECK(x1.one(home)); returnhome.ES_SUBSUMED(*this); } returnES_FIX; } template<classBV> ExecStatus NaryOrTrue<BV>::propagate(Space&home,constModEventDelta&){ if(x0.one()) returnhome.ES_SUBSUMED(*this); if(x1.one()) returnhome.ES_SUBSUMED(*this); GECODE_ES_CHECK(resubscribe(home,x0,x1)); GECODE_ES_CHECK(resubscribe(home,x1,x0)); returnES_FIX; } /* *N-aryBooleandisjunctionpropagator * */ template<classVX,classVY> forceinline NaryOr<VX,VY>::NaryOr(Homehome,ViewArray<VX>&x,VYy) :MixNaryOnePropagator<VX,PC_BOOL_NONE,VY,PC_BOOL_VAL>(home,x,y), n_zero(0),c(home){ x.subscribe(home,*new(home)Advisor(home,*this,c)); } template<classVX,classVY> forceinline NaryOr<VX,VY>::NaryOr(Space&home,boolshare,NaryOr<VX,VY>&p) :MixNaryOnePropagator<VX,PC_BOOL_NONE,VY,PC_BOOL_VAL>(home,share,p), n_zero(p.n_zero){ c.update(home,share,p.c); } template<classVX,classVY> Actor* NaryOr<VX,VY>::copy(Space&home,boolshare){ assert(n_zero<x.size()); if(n_zero>0){ intn=x.size(); //Eliminateallzeros for(inti=n;i--;) if(x[i].zero()) x[i]=x[--n]; x.size(n); n_zero=0; } assert(n_zero<x.size()); returnnew(home)NaryOr<VX,VY>(home,share,*this); } template<classVX,classVY> inlineExecStatus NaryOr<VX,VY>::post(Homehome,ViewArray<VX>&x,VYy){ assert(!x.shared(home)); if(y.one()) returnNaryOrTrue<VX>::post(home,x); if(y.zero()){ for(inti=x.size();i--;) GECODE_ME_CHECK(x[i].zero(home)); returnES_OK; } for(inti=x.size();i--;) if(x[i].one()){ GECODE_ME_CHECK(y.one_none(home)); returnES_OK; }elseif(x[i].zero()){ x.move_lst(i); } if(x.size()==0){ GECODE_ME_CHECK(y.zero_none(home)); }elseif(x.size()==1){ returnEq<VX,VY>::post(home,x[0],y); }elseif(x.size()==2){ returnOr<VX,VX,VY>::post(home,x[0],x[1],y); }else{ (void)new(home)NaryOr(home,x,y); } returnES_OK; } template<classVX,classVY> PropCost NaryOr<VX,VY>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::unary(PropCost::LO); } template<classVX,classVY> ExecStatus NaryOr<VX,VY>::advise(Space&,Advisor&,constDelta&d){ //Decideswhetherthepropagatormustberun if(VX::zero(d)&&(++n_zero<x.size())) returnES_FIX; else returnES_NOFIX; } template<classVX,classVY> forceinlinesize_t NaryOr<VX,VY>::dispose(Space&home){ Advisors<Advisor>as(c); x.cancel(home,as.advisor()); c.dispose(home); (void)MixNaryOnePropagator<VX,PC_BOOL_NONE,VY,PC_BOOL_VAL> ::dispose(home); returnsizeof(*this); } template<classVX,classVY> ExecStatus NaryOr<VX,VY>::propagate(Space&home,constModEventDelta&){ if(y.one()) GECODE_REWRITE(*this,NaryOrTrue<VX>::post(home(*this),x)); if(y.zero()){ //Notethatthismighttriggertheadvisorofthispropagator! for(inti=x.size();i--;) GECODE_ME_CHECK(x[i].zero(home)); }elseif(n_zero==x.size()){ //Allviewsarezero GECODE_ME_CHECK(y.zero_none(home)); }else{ //Thereisexactlyoneviewwhichisone GECODE_ME_CHECK(y.one_none(home)); } returnhome.ES_SUBSUMED(*this); } }}} //STATISTICS:int-prop