max.hpp gecode/int/rel.hh /usr/include/gecode/int/arithmetic.hh gecode/support/cast.hpp gecode/iter/values-ranges.hpp gecode/int/div.hh gecode/int/view/scale.hpp gecode/iter/ranges-rangelist.hpp gecode/kernel/brancher-val-sel-commit.hpp gecode/iter/values-map.hpp gecode/iter/ranges-negative.hpp gecode/support/static-stack.hpp gecode/kernel/var-imp.hpp gecode/support/random.hpp gecode/int/rel/nq.hpp limits gecode/kernel/var.hpp gecode/int/view/bool.hpp gecode/iter/ranges-size.hpp gecode/support/thread/none.hpp iterator gecode/iter/ranges-array.hpp gecode/support/timer.hpp gecode/support/thread/thread.hpp gecode/iter/ranges-singleton-append.hpp gecode/iter/ranges-positive.hpp gecode/kernel/brancher-val-commit.hpp gecode/int/view/iter.hpp gecode/int/rel.hh gecode/kernel/afc.hpp gecode/kernel/var-type.hpp gecode/support/hw-rnd.hpp gecode/iter/values-bitsetoffset.hpp /usr/include/gecode/int/arithmetic/max.hpp cmath cassert gecode/kernel/brancher-view-sel.hpp gecode/kernel/allocators.hpp gecode/int/int-set-2.hpp cstdarg gecode/support/bitset-base.hpp gecode/kernel/shared-array.hpp gecode/int/view/cached.hpp gecode/kernel/modevent.hpp gecode/kernel/memory-config.hpp gecode/int/branch/val.hpp gecode/support/int-type.hpp gecode/iter/values-positive.hpp cfloat gecode/int/exception.hpp gecode/support/exception.hpp exception gecode/iter/ranges-map.hpp gecode/kernel/region.hpp gecode/support/marked-pointer.hpp gecode/support/thread.hpp gecode/kernel.hh gecode/int/int-set-1.hpp gecode/kernel/branch-traits.hpp gecode/int/view/zero.hpp gecode/iter/ranges-compl.hpp gecode/int/extensional/dfa.hpp gecode/kernel/array.hpp gecode/int/branch/afc.hpp gecode/kernel/branch-val.hpp gecode/support/dynamic-stack.hpp gecode/iter/ranges-scale.hpp gecode/kernel/archive.hpp gecode/kernel/range-list.hpp gecode/iter/values-inter.hpp gecode/kernel/brancher-merit.hpp gecode/support/config.hpp gecode/int/view/bool-test.hpp gecode/iter/ranges-add.hpp gecode/int/view.hpp gecode/iter/values-list.hpp gecode/iter/values-minus.hpp gecode/kernel/branch-var.hpp gecode/int/rel/lq-le.hpp gecode/kernel/memory-manager.hpp gecode/int/limits.hpp gecode/support/dynamic-queue.hpp gecode/int/propagator.hpp gecode/int/branch/traits.hpp gecode/iter/values-union.hpp gecode/kernel/macros.hpp gecode/iter/ranges-offset.hpp ctime gecode/int/view/offset.hpp gecode/iter/values-array.hpp gecode/int/branch/var.hpp gecode/iter/ranges-singleton.hpp vector gecode/int/rel/lex.hpp gecode/int/view/print.hpp gecode/kernel/advisor.hpp gecode/int/extensional/tuple-set.hpp gecode/kernel/brancher-view-val.hpp gecode/int/view/int.hpp gecode/int/view/rel-test.hpp sstream gecode/int/array-traits.hpp gecode/kernel/brancher-val-sel.hpp gecode/kernel/propagator.hpp gecode/support/block-allocator.hpp gecode/int/div.hpp gecode/iter/values-offset.hpp gecode/int/array.hpp gecode/kernel/activity.hpp gecode/int.hh cstdlib gecode/support/bitset.hpp gecode/int/var/bool.hpp gecode/support/auto-link.hpp gecode/int/branch/assign.hpp iostream gecode/kernel/exception.hpp gecode/int/view/neg-bool.hpp gecode/iter/ranges-minus.hpp gecode/iter/values-negative.hpp gecode/support/macros.hpp gecode/kernel/view.hpp gecode/kernel/branch-tiebreak.hpp cstddef climits gecode/iter/values-singleton.hpp gecode/kernel/core.hpp gecode/iter/ranges-inter.hpp gecode/iter/ranges-append.hpp gecode/iter/ranges-operations.hpp gecode/support.hh gecode/int/branch/activity.hpp gecode/int/var-imp/int.hpp gecode/int/var-imp.hpp gecode/iter/ranges-cache.hpp gecode/support/dynamic-array.hpp gecode/int/view/constint.hpp gecode/iter/values-unique.hpp gecode/iter/ranges-diff.hpp gecode/support/sort.hpp gecode/int/var-imp/delta.hpp gecode/kernel/rnd.hpp algorithm gecode/kernel/brancher-view.hpp gecode/int/rel/eq.hpp gecode/iter/values-bitset.hpp gecode/kernel/global-afc.hpp gecode/iter/ranges-empty.hpp gecode/int/var/int.hpp gecode/iter.hh gecode/iter/ranges-values.hpp gecode/int/var-imp/bool.hpp cstring gecode/int/reify.hpp gecode/iter/ranges-union.hpp gecode/int/view/minus.hpp gecode/iter/ranges-minmax.hpp gecode/support/bitset-offset.hpp gecode/support/heap.hpp gecode/int/var/print.hpp gecode/iter/ranges-list.hpp /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/arithmetic/max.hpp Gecode Gecode::Int Gecode::Int::Arithmetic /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2004 * *Lastmodified: *$Date:2012-09-0717:31:22+0200(Fri,07Sep2012)$by$Author:schulte$ *$Revision:13068$ * *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. * */ #include<gecode/int/rel.hh> namespaceGecode{namespaceInt{namespaceArithmetic{ /* *Ternaryboundsconsistentmaximum * */ template<classView> forceinlineExecStatus prop_max_bnd(Space&home,Viewx0,Viewx1,Viewx2){ boolmod=false; do{ mod=false; { ModEventme=x2.lq(home,std::max(x0.max(),x1.max())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x2.gq(home,std::max(x0.min(),x1.min())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x0.lq(home,x2.max()); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x1.lq(home,x2.max()); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } }while(mod); returnES_OK; } template<classView> forceinline MaxBnd<View>::MaxBnd(Homehome,Viewx0,Viewx1,Viewx2) :TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2){} template<classView> ExecStatus MaxBnd<View>::post(Homehome,Viewx0,Viewx1,Viewx2){ GECODE_ME_CHECK(x2.gq(home,std::max(x0.min(),x1.min()))); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); if(same(x0,x1)) returnRel::EqBnd<View,View>::post(home,x0,x2); if(same(x0,x2)) returnRel::Lq<View>::post(home,x1,x2); if(same(x1,x2)) returnRel::Lq<View>::post(home,x0,x2); (void)new(home)MaxBnd<View>(home,x0,x1,x2); returnES_OK; } template<classView> forceinline MaxBnd<View>::MaxBnd(Space&home,boolshare,MaxBnd<View>&p) :TernaryPropagator<View,PC_INT_BND>(home,share,p){} template<classView> forceinline MaxBnd<View>::MaxBnd(Space&home,boolshare,Propagator&p, Viewx0,Viewx1,Viewx2) :TernaryPropagator<View,PC_INT_BND>(home,share,p,x0,x1,x2){} template<classView> Actor* MaxBnd<View>::copy(Space&home,boolshare){ returnnew(home)MaxBnd<View>(home,share,*this); } template<classView> ExecStatus MaxBnd<View>::propagate(Space&home,constModEventDelta&){ GECODE_ES_CHECK(prop_max_bnd(home,x0,x1,x2)); if((x0.max()<=x1.min())||(x0.max()<x2.min())) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x1,x2))); if((x1.max()<=x0.min())||(x1.max()<x2.min())) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x0,x2))); returnx0.assigned()&&x1.assigned()&&x2.assigned()? home.ES_SUBSUMED(*this):ES_FIX; } /* *Naryboundsconsistentmaximum * */ template<classView> forceinline NaryMaxBnd<View>::NaryMaxBnd(Homehome,ViewArray<View>&x,Viewy) :NaryOnePropagator<View,PC_INT_BND>(home,x,y){} template<classView> ExecStatus NaryMaxBnd<View>::post(Homehome,ViewArray<View>&x,Viewy){ assert(x.size()>0); x.unique(home); if(x.size()==1) returnRel::EqBnd<View,View>::post(home,x[0],y); if(x.size()==2) returnMaxBnd<View>::post(home,x[0],x[1],y); intl=Int::Limits::min; intu=Int::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)NaryMaxBnd<View>(home,x,y); } returnES_OK; } template<classView> forceinline NaryMaxBnd<View>::NaryMaxBnd(Space&home,boolshare,NaryMaxBnd<View>&p) :NaryOnePropagator<View,PC_INT_BND>(home,share,p){} template<classView> Actor* NaryMaxBnd<View>::copy(Space&home,boolshare){ if(x.size()==1) returnnew(home)Rel::EqBnd<View,View>(home,share,*this,x[0],y); if(x.size()==2) returnnew(home)MaxBnd<View>(home,share,*this,x[0],x[1],y); returnnew(home)NaryMaxBnd<View>(home,share,*this); } enumMaxPropStatus{ MPS_ASSIGNED=1<<0, MPS_REMOVED=1<<1, MPS_NEW_BOUND=1<<2 }; template<classView> forceinlineExecStatus prop_nary_max_bnd(Space&home,Propagator&p, ViewArray<View>&x,Viewy,PropCondpc){ rerun: assert(x.size()>0); intmaxmax=x[x.size()-1].max(); intmaxmin=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_INT_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 NaryMaxBnd<View>::propagate(Space&home,constModEventDelta&){ ExecStatuses=prop_nary_max_bnd(home,*this,x,y,PC_INT_BND); GECODE_ES_CHECK(es); if(x.size()==1) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x[0],y))); returnes; } /* *Ternarydomainconsistentmaximum * */ template<classView> forceinline MaxDom<View>::MaxDom(Homehome,Viewx0,Viewx1,Viewx2) :TernaryPropagator<View,PC_INT_DOM>(home,x0,x1,x2){} template<classView> ExecStatus MaxDom<View>::post(Homehome,Viewx0,Viewx1,Viewx2){ GECODE_ME_CHECK(x2.gq(home,std::max(x0.min(),x1.min()))); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); if(same(x0,x1)) returnRel::EqDom<View,View>::post(home,x0,x2); if(same(x0,x2)) returnRel::Lq<View>::post(home,x1,x2); if(same(x1,x2)) returnRel::Lq<View>::post(home,x0,x2); (void)new(home)MaxDom<View>(home,x0,x1,x2); returnES_OK; } template<classView> forceinline MaxDom<View>::MaxDom(Space&home,boolshare,MaxDom<View>&p) :TernaryPropagator<View,PC_INT_DOM>(home,share,p){} template<classView> forceinline MaxDom<View>::MaxDom(Space&home,boolshare,Propagator&p, Viewx0,Viewx1,Viewx2) :TernaryPropagator<View,PC_INT_DOM>(home,share,p,x0,x1,x2){} template<classView> Actor* MaxDom<View>::copy(Space&home,boolshare){ returnnew(home)MaxDom<View>(home,share,*this); } template<classView> PropCost MaxDom<View>::cost(constSpace&,constModEventDelta&med)const{ returnPropCost::ternary((View::me(med)==ME_INT_DOM)? PropCost::HI:PropCost::LO); } template<classView> ExecStatus MaxDom<View>::propagate(Space&home,constModEventDelta&med){ if(View::me(med)!=ME_INT_DOM){ GECODE_ES_CHECK(prop_max_bnd(home,x0,x1,x2)); if((x0.max()<=x1.min())||(x0.max()<x2.min())) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x1,x2))); if((x1.max()<=x0.min())||(x1.max()<x2.min())) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x0,x2))); returnx0.assigned()&&x1.assigned()&&x2.assigned()? home.ES_SUBSUMED(*this): home.ES_NOFIX_PARTIAL(*this,View::med(ME_INT_DOM)); } ViewRanges<View>r0(x0),r1(x1); Iter::Ranges::Union<ViewRanges<View>,ViewRanges<View>>u(r0,r1); GECODE_ME_CHECK(x2.inter_r(home,u,false)); if(rtest_nq_dom(x0,x2)==RT_TRUE){ GECODE_ES_CHECK(Rel::Lq<View>::post(home,x0,x2)); GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x1,x2))); } if(rtest_nq_dom(x1,x2)==RT_TRUE){ GECODE_ES_CHECK(Rel::Lq<View>::post(home,x1,x2)); GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x0,x2))); } returnES_FIX; } /* *Narydomainconsistentmaximum * */ template<classView> forceinline NaryMaxDom<View>::NaryMaxDom(Homehome,ViewArray<View>&x,Viewy) :NaryOnePropagator<View,PC_INT_DOM>(home,x,y){} template<classView> ExecStatus NaryMaxDom<View>::post(Homehome,ViewArray<View>&x,Viewy){ assert(x.size()>0); x.unique(home); if(x.size()==1) returnRel::EqDom<View,View>::post(home,x[0],y); if(x.size()==2) returnMaxDom<View>::post(home,x[0],x[1],y); intl=Int::Limits::min; intu=Int::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)NaryMaxDom<View>(home,x,y); } returnES_OK; } template<classView> forceinline NaryMaxDom<View>::NaryMaxDom(Space&home,boolshare,NaryMaxDom<View>&p) :NaryOnePropagator<View,PC_INT_DOM>(home,share,p){} template<classView> Actor* NaryMaxDom<View>::copy(Space&home,boolshare){ if(x.size()==1) returnnew(home)Rel::EqDom<View,View>(home,share,*this,x[0],y); if(x.size()==2) returnnew(home)MaxDom<View>(home,share,*this,x[0],x[1],y); returnnew(home)NaryMaxDom<View>(home,share,*this); } template<classView> PropCost NaryMaxDom<View>::cost(constSpace&,constModEventDelta&med)const{ if(View::me(med)==ME_INT_DOM) returnPropCost::linear(PropCost::HI,y.size()); else returnPropCost::linear(PropCost::LO,x.size()); } template<classView> ExecStatus NaryMaxDom<View>::propagate(Space&home,constModEventDelta&med){ if(View::me(med)!=ME_INT_DOM){ ExecStatuses=prop_nary_max_bnd(home,*this,x,y,PC_INT_DOM); GECODE_ES_CHECK(es); return(es==ES_FIX)? home.ES_FIX_PARTIAL(*this,View::med(ME_INT_DOM)): home.ES_NOFIX_PARTIAL(*this,View::med(ME_INT_DOM)); } Regionr(home); ViewRanges<View>*i_x=r.alloc<ViewRanges<View>>(x.size()); for(inti=x.size();i--;){ ViewRanges<View>i_xi(x[i]);i_x[i]=i_xi; } Iter::Ranges::NaryUnionu(r,i_x,x.size()); GECODE_ME_CHECK(y.inter_r(home,u,false)); for(inti=x.size();i--;) if(rtest_nq_dom(x[i],y)==RT_TRUE){ GECODE_ES_CHECK(Rel::Lq<View>::post(home,x[i],y)); x.move_lst(i,home,*this,PC_INT_DOM); } assert(x.size()>0); if(x.size()==1) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x[0],y))); returnES_FIX; } }}} //STATISTICS:int-prop