min-max-channel.hpp cmath /usr/include/gecode/float/arithmetic.hh cmath /usr/include/gecode/float/arithmetic/min-max-channel.hpp /usr/include/gecode/float/arithmetic/min-max-channel.hpp /usr/include/gecode/float/arithmetic.hh Gecode Gecode::Float Gecode::Float::Arithmetic /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> *VincentBarichard<Vincent.Barichard@univ-angers.fr> * *Copyright: *ChristianSchulte,2004 *VincentBarichard,2012 * *Lastmodified: *$Date:2013-02-1416:29:11+0100(Thu,14Feb2013)$by$Author:schulte$ *$Revision:13292$ * *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{namespaceFloat{namespaceArithmetic{ #include<cmath> /* *Boundsconsistentminoperator * */ template<classA,classB,classC> forceinline Min<A,B,C>::Min(Homehome,Ax0,Bx1,Cx2) :MixTernaryPropagator<A,PC_FLOAT_BND,B,PC_FLOAT_BND,C,PC_FLOAT_BND>(home,x0,x1,x2){} template<classA,classB,classC> forceinline Min<A,B,C>::Min(Space&home,boolshare,Min<A,B,C>&p) :MixTernaryPropagator<A,PC_FLOAT_BND,B,PC_FLOAT_BND,C,PC_FLOAT_BND>(home,share,p){} template<classA,classB,classC> forceinline Min<A,B,C>::Min(Space&home,boolshare,Propagator&p, Ax0,Bx1,Cx2) :MixTernaryPropagator<A,PC_FLOAT_BND,B,PC_FLOAT_BND,C,PC_FLOAT_BND>(home,share,p,x0,x1,x2){} template<classA,classB,classC> Actor* Min<A,B,C>::copy(Space&home,boolshare){ returnnew(home)Min<A,B,C>(home,share,*this); } template<classA,classB,classC> ExecStatus Min<A,B,C>::post(Homehome,Ax0,Bx1,Cx2){ (void)new(home)Min<A,B,C>(home,x0,x1,x2); returnES_OK; } template<classA,classB,classC> ExecStatus Min<A,B,C>::propagate(Space&home,constModEventDelta&){ GECODE_ME_CHECK(x2.eq(home,min(x0.domain(),x1.domain()))); GECODE_ME_CHECK(x0.gq(home,x2.min())); GECODE_ME_CHECK(x1.gq(home,x2.min())); if(same(x0,x1)){ GECODE_ME_CHECK(x0.lq(home,x2.max())); }else{ if(!overlap(x1.val(),x2.val()))GECODE_ME_CHECK(x0.lq(home,x2.max())); if(!overlap(x0.val(),x2.val()))GECODE_ME_CHECK(x1.lq(home,x2.max())); } return(x0.assigned()&&x1.assigned())?home.ES_SUBSUMED(*this):ES_FIX; } /* *Boundsconsistentmaxoperator * */ template<classA,classB,classC> forceinline Max<A,B,C>::Max(Homehome,Ax0,Bx1,Cx2) :MixTernaryPropagator<A,PC_FLOAT_BND,B,PC_FLOAT_BND,C,PC_FLOAT_BND>(home,x0,x1,x2){} template<classA,classB,classC> forceinline Max<A,B,C>::Max(Space&home,boolshare,Max<A,B,C>&p) :MixTernaryPropagator<A,PC_FLOAT_BND,B,PC_FLOAT_BND,C,PC_FLOAT_BND>(home,share,p){} template<classA,classB,classC> forceinline Max<A,B,C>::Max(Space&home,boolshare,Propagator&p, Ax0,Bx1,Cx2) :MixTernaryPropagator<A,PC_FLOAT_BND,B,PC_FLOAT_BND,C,PC_FLOAT_BND>(home,share,p,x0,x1,x2){} template<classA,classB,classC> Actor* Max<A,B,C>::copy(Space&home,boolshare){ returnnew(home)Max<A,B,C>(home,share,*this); } template<classA,classB,classC> ExecStatus Max<A,B,C>::post(Homehome,Ax0,Bx1,Cx2){ (void)new(home)Max<A,B,C>(home,x0,x1,x2); returnES_OK; } template<classA,classB,classC> ExecStatus Max<A,B,C>::propagate(Space&home,constModEventDelta&){ GECODE_ME_CHECK(x2.eq(home,max(x0.domain(),x1.domain()))); GECODE_ME_CHECK(x0.lq(home,x2.max())); GECODE_ME_CHECK(x1.lq(home,x2.max())); if(same(x0,x1)){ GECODE_ME_CHECK(x0.gq(home,x2.min())); }else{ if(!overlap(x1.val(),x2.val()))GECODE_ME_CHECK(x0.gq(home,x2.min())); if(!overlap(x0.val(),x2.val()))GECODE_ME_CHECK(x1.gq(home,x2.min())); } return(x0.assigned()&&x1.assigned())?home.ES_SUBSUMED(*this):ES_FIX; } /* *Naryboundsconsistentmaximum * */ template<classView> forceinline NaryMax<View>::NaryMax(Homehome,ViewArray<View>&x,Viewy) :NaryOnePropagator<View,PC_FLOAT_BND>(home,x,y){} template<classView> ExecStatus NaryMax<View>::post(Homehome,ViewArray<View>&x,Viewy){ assert(x.size()>0); x.unique(home); if(x.size()==1) returnRel::Eq<View,View>::post(home,x[0],y); if(x.size()==2) returnMax<View,View,View>::post(home,x[0],x[1],y); FloatNuml=Float::Limits::min; FloatNumu=Float::Limits::min; for(inti=x.size();i--;){ l=std::max(l,x[i].min()); u=std::max(u,x[i].max()); } GECODE_ME_CHECK(y.gq(home,l)); GECODE_ME_CHECK(y.lq(home,u)); if(x.same(home,y)){ //Checkwhetheryoccursinx for(inti=x.size();i--;) GECODE_ES_CHECK((Rel::Lq<View>::post(home,x[i],y))); }else{ (void)new(home)NaryMax<View>(home,x,y); } returnES_OK; } template<classView> forceinline NaryMax<View>::NaryMax(Space&home,boolshare,NaryMax<View>&p) :NaryOnePropagator<View,PC_FLOAT_BND>(home,share,p){} template<classView> Actor* NaryMax<View>::copy(Space&home,boolshare){ if(x.size()==1) returnnew(home)Rel::Eq<View,View>(home,share,*this,x[0],y); if(x.size()==2) returnnew(home)Max<View,View,View>(home,share,*this,x[0],x[1],y); returnnew(home)NaryMax<View>(home,share,*this); } enumMaxPropStatus{ MPS_ASSIGNED=1<<0, MPS_REMOVED=1<<1, MPS_NEW_BOUND=1<<2 }; template<classView> forceinlineExecStatus prop_nary_max(Space&home,Propagator&p, ViewArray<View>&x,Viewy,PropCondpc){ rerun: assert(x.size()>0); FloatNummaxmax=x[x.size()-1].max(); FloatNummaxmin=x[x.size()-1].min(); for(inti=x.size()-1;i--;){ maxmax=std::max(x[i].max(),maxmax); maxmin=std::max(x[i].min(),maxmin); } GECODE_ME_CHECK(y.lq(home,maxmax)); GECODE_ME_CHECK(y.gq(home,maxmin)); maxmin=y.min(); maxmax=y.max(); intstatus=MPS_ASSIGNED; for(inti=x.size();i--;){ ModEventme=x[i].lq(home,maxmax); if(me==ME_FLOAT_FAILED) returnES_FAILED; if(me_modified(me)&&(x[i].max()!=maxmax)) status|=MPS_NEW_BOUND; if(x[i].max()<maxmin){ x.move_lst(i,home,p,pc); status|=MPS_REMOVED; }elseif(!x[i].assigned()) status&=~MPS_ASSIGNED; } if(x.size()==0) returnES_FAILED; if((status&MPS_REMOVED)!=0) gotorerun; if(((status&MPS_ASSIGNED)!=0)&&y.assigned()) returnhome.ES_SUBSUMED(p); return((status&MPS_NEW_BOUND)!=0)?ES_NOFIX:ES_FIX; } template<classView> ExecStatus NaryMax<View>::propagate(Space&home,constModEventDelta&){ returnprop_nary_max(home,*this,x,y,PC_FLOAT_BND); } /* *Boundsconsistentintergerpartoperator * */ template<classA,classB> forceinline Channel<A,B>::Channel(Homehome,Ax0,Bx1) :MixBinaryPropagator<A,PC_FLOAT_BND,B,Int::PC_INT_BND>(home,x0,x1){} template<classA,classB> forceinline Channel<A,B>::Channel(Space&home,boolshare,Channel<A,B>&p) :MixBinaryPropagator<A,PC_FLOAT_BND,B,Int::PC_INT_BND>(home,share,p){} template<classA,classB> Actor* Channel<A,B>::copy(Space&home,boolshare){ returnnew(home)Channel<A,B>(home,share,*this); } template<classA,classB> ExecStatus Channel<A,B>::post(Homehome,Ax0,Bx1){ GECODE_ME_CHECK(x0.eq(home,FloatVal(Int::Limits::min, Int::Limits::max))); (void)new(home)Channel<A,B>(home,x0,x1); returnES_OK; } template<classA,classB> ExecStatus Channel<A,B>::propagate(Space&home,constModEventDelta&){ GECODE_ME_CHECK(x1.gq(home,static_cast<int>(std::ceil(x0.min())))); GECODE_ME_CHECK(x1.lq(home,static_cast<int>(std::floor(x0.max())))); GECODE_ME_CHECK(x0.eq(home,FloatVal(x1.min(),x1.max()))); returnx0.assigned()?home.ES_SUBSUMED(*this):ES_FIX; } }}} //STATISTICS:float-prop