nroot.hpp gecode/int/rel.hh climits algorithm /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 /usr/include/gecode/int/arithmetic/nroot.hpp gecode/iter/values-bitsetoffset.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/nroot.hpp Gecode::Int::Arithmetic::RangesMapPow Gecode::Int::Arithmetic::RangesMapNroot Gecode Gecode::Int Gecode::Int::Arithmetic /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2012 * *Lastmodified: *$Date:2013-08-2916:05:54+0200(Thu,29Aug2013)$by$Author:schulte$ *$Revision:13993$ * *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> #include<climits> #include<algorithm> namespaceGecode{namespaceInt{namespaceArithmetic{ /* *Positiveboundsconsistentnthroot * */ template<classOps,boolminus> forceinlineExecStatus prop_nroot_plus_bnd(Space&home,IntViewx0,IntViewx1,constOps&ops){ if(minus){ boolmod; do{ mod=false; { ModEventme=x1.gq(home,-ops.cnroot(-x0.min())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x1.lq(home,-ops.cnroot(-x0.max())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x0.gq(home,-ops.tpow(-x1.min())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x0.lq(home,-(ops.tpow(-x1.max()-1)+1)); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } }while(mod); }else{ boolmod; do{ mod=false; { ModEventme=x1.lq(home,ops.fnroot(x0.max())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x1.gq(home,ops.fnroot(x0.min())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x0.le(home,ops.tpow(x1.max()+1)); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } { ModEventme=x0.gq(home,ops.tpow(x1.min())); if(me_failed(me))returnES_FAILED; mod|=me_modified(me); } }while(mod); } returnES_OK; } template<classOps,boolminus> forceinline NrootPlusBnd<Ops,minus>::NrootPlusBnd(Homehome,IntViewx0,IntViewx1, constOps&o) :BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), ops(o){} template<classOps,boolminus> forceinlineExecStatus NrootPlusBnd<Ops,minus>::post(Homehome,IntViewx0,IntViewx1,Opsops){ if(minus){ GECODE_ME_CHECK(x0.lq(home,0)); GECODE_ME_CHECK(x1.lq(home,0)); }else{ GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); } (void)new(home)NrootPlusBnd<Ops,minus>(home,x0,x1,ops); returnES_OK; } template<classOps,boolminus> forceinline NrootPlusBnd<Ops,minus>::NrootPlusBnd(Space&home,boolshare, NrootPlusBnd<Ops,minus>&p) :BinaryPropagator<IntView,PC_INT_BND>(home,share,p), ops(p.ops){} template<classOps,boolminus> Actor* NrootPlusBnd<Ops,minus>::copy(Space&home,boolshare){ returnnew(home)NrootPlusBnd<Ops,minus>(home,share,*this); } template<classOps,boolminus> ExecStatus NrootPlusBnd<Ops,minus>::propagate(Space&home,constModEventDelta&){ GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops))); returnx1.assigned()?home.ES_SUBSUMED(*this):ES_FIX; } /* *Boundsconsistentnthroot * */ template<classOps> forceinlineExecStatus prop_nroot_bnd(Space&home,IntViewx0,IntViewx1,constOps&ops){ assert((x0.min()<0)&&(x0.max()>0)); assert((x1.min()<0)&&(x1.max()>0)); GECODE_ME_CHECK(x1.lq(home,ops.fnroot(x0.max()))); GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-x0.min()))); GECODE_ME_CHECK(x0.le(home,ops.tpow(x1.max()+1))); GECODE_ME_CHECK(x0.gq(home,ops.tpow(x1.min()-1)+1)); returnES_OK; } template<classOps> forceinline NrootBnd<Ops>::NrootBnd(Homehome,IntViewx0,IntViewx1,constOps&o) :BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), ops(o){} template<classOps> forceinlineExecStatus NrootBnd<Ops>::post(Homehome,IntViewx0,IntViewx1,Opsops){ if(static_cast<unsignedint>(ops.exp())>=sizeof(int)*CHAR_BIT){ //Theintegerlimitsallowonly-2,-1,0,1forx1 GECODE_ME_CHECK(x1.lq(home,1)); GECODE_ME_CHECK(x1.gq(home,-2)); //Justrewritetovaluesthatcanbehandeledwithoutoverflow ops.exp(ops.even()?30:31); } if(ops.exp()==0){ GECODE_ME_CHECK(x1.eq(home,1)); returnES_OK; }elseif(ops.exp()==1){ returnRel::EqBnd<IntView,IntView>::post(home,x0,x1); } if(same(x0,x1)){ assert(ops.exp()>1); GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,ops.even()?0:-2)); returnES_OK; } //Limitsvaluessuchthatnooverflowcanoccur GECODE_ME_CHECK(x1.lq(home,ops.fnroot(Limits::max))); GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-Limits::min))); if(ops.even()){ GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); } if((x0.min()>=0)||(x1.min()>=0)) returnNrootPlusBnd<Ops,false>::post(home,x0,x1,ops); if((x0.max()<=0)||(x1.max()<=0)) returnNrootPlusBnd<Ops,true>::post(home,x0,x1,ops); assert((x0.min()<0)&&(x0.max()>0)); assert((x1.min()<0)&&(x1.max()>0)); GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops)); (void)new(home)NrootBnd(home,x0,x1,ops); returnES_OK; } template<classOps> forceinline NrootBnd<Ops>::NrootBnd(Space&home,boolshare,NrootBnd<Ops>&p) :BinaryPropagator<IntView,PC_INT_BND>(home,share,p), ops(p.ops){} template<classOps> Actor* NrootBnd<Ops>::copy(Space&home,boolshare){ returnnew(home)NrootBnd<Ops>(home,share,*this); } template<classOps> ExecStatus NrootBnd<Ops>::propagate(Space&home,constModEventDelta&){ assert(!ops.even()); if((x0.min()>=0)||(x1.min()>=0)) GECODE_REWRITE(*this,(NrootPlusBnd<Ops,false>::post(home,x0,x1,ops))); if((x0.max()<=0)||(x1.max()<=0)) GECODE_REWRITE(*this,(NrootPlusBnd<Ops,true>::post(home,x0,x1,ops))); GECODE_ES_CHECK(prop_nroot_bnd(home,x0,x1,ops)); returnx0.assigned()&&x1.assigned()?home.ES_SUBSUMED(*this):ES_NOFIX; } /* *Domainconsistentnthroot * */ template<classOps> classRangesMapPow{ protected: Opsops; public: forceinlineRangesMapPow(constOps&o):ops(o){} forceinlineintmin(intx)const{ returnops.tpow(x); } forceinlineintmax(intx)const{ returnops.tpow(x+1)-1; } }; template<classOps> classRangesMapNroot{ protected: Opsops; public: forceinlineRangesMapNroot(constOps&o):ops(o){} forceinlineintmin(intx)const{ return(x<0)?-ops.cnroot(-x):ops.fnroot(x); } forceinlineintmax(intx)const{ return(x<0)?-ops.cnroot(-x):ops.fnroot(x); } }; template<classOps,boolminus> forceinline NrootPlusDom<Ops,minus>::NrootPlusDom(Homehome,IntViewx0,IntViewx1, constOps&o) :BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1), ops(o){} template<classOps,boolminus> forceinlineExecStatus NrootPlusDom<Ops,minus>::post(Homehome,IntViewx0,IntViewx1,Opsops){ if(minus){ GECODE_ME_CHECK(x0.lq(home,0)); GECODE_ME_CHECK(x1.lq(home,0)); }else{ GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); } GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops))); (void)new(home)NrootPlusDom<Ops,minus>(home,x0,x1,ops); returnES_OK; } template<classOps,boolminus> forceinline NrootPlusDom<Ops,minus>::NrootPlusDom(Space&home,boolshare, NrootPlusDom<Ops,minus>&p) :BinaryPropagator<IntView,PC_INT_DOM>(home,share,p), ops(p.ops){} template<classOps,boolminus> Actor* NrootPlusDom<Ops,minus>::copy(Space&home,boolshare){ returnnew(home)NrootPlusDom<Ops,minus>(home,share,*this); } template<classOps,boolminus> PropCost NrootPlusDom<Ops,minus>::cost(constSpace&,constModEventDelta&med)const{ if(IntView::me(med)==ME_INT_VAL) returnPropCost::unary(PropCost::LO); elseif(IntView::me(med)==ME_INT_DOM) returnPropCost::binary(PropCost::HI); else returnPropCost::binary(PropCost::LO); } template<classOps,boolminus> ExecStatus NrootPlusDom<Ops,minus>::propagate(Space&home,constModEventDelta&med){ if(IntView::me(med)!=ME_INT_DOM){ GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops))); returnx1.assigned()?home.ES_SUBSUMED(*this) :home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM)); } { ViewRanges<IntView>r(x0); RangesMapNroot<Ops>rmn(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapNroot<Ops>,false> m(r,rmn); GECODE_ME_CHECK(x1.inter_r(home,m,false)); } { ViewRanges<IntView>r(x1); RangesMapPow<Ops>rmp(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapPow<Ops>,true> m(r,rmp); GECODE_ME_CHECK(x0.inter_r(home,m,false)); } returnx1.assigned()?home.ES_SUBSUMED(*this):ES_FIX; } template<classOps> forceinline NrootDom<Ops>::NrootDom(Homehome,IntViewx0,IntViewx1,constOps&o) :BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1), ops(o){} template<classOps> forceinlineExecStatus NrootDom<Ops>::post(Homehome,IntViewx0,IntViewx1,Opsops){ if(static_cast<unsignedint>(ops.exp())>=sizeof(int)*CHAR_BIT){ //Theintegerlimitsallowonly-2,-1,0,1forx1 GECODE_ME_CHECK(x1.lq(home,1)); GECODE_ME_CHECK(x1.gq(home,-2)); //Justrewritetovaluesthatcanbehandeledwithoutoverflow ops.exp(ops.even()?30:31); } if(ops.exp()==0){ GECODE_ME_CHECK(x1.eq(home,1)); returnES_OK; }elseif(ops.exp()==1){ returnRel::EqDom<IntView,IntView>::post(home,x0,x1); } if(same(x0,x1)){ assert(ops.exp()>1); GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,ops.even()?0:-2)); returnES_OK; } //Limitsvaluessuchthatnooverflowcanoccur GECODE_ME_CHECK(x1.lq(home,ops.fnroot(Limits::max))); GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-Limits::min))); if(ops.even()){ GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); } if((x0.min()>=0)||(x1.min()>=0)) returnNrootPlusDom<Ops,false>::post(home,x0,x1,ops); if((x0.max()<=0)||(x1.max()<=0)) returnNrootPlusDom<Ops,true>::post(home,x0,x1,ops); assert((x0.min()<0)&&(x0.max()>0)); assert((x1.min()<0)&&(x1.max()>0)); GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops)); (void)new(home)NrootDom(home,x0,x1,ops); returnES_OK; } template<classOps> forceinline NrootDom<Ops>::NrootDom(Space&home,boolshare,NrootDom<Ops>&p) :BinaryPropagator<IntView,PC_INT_DOM>(home,share,p), ops(p.ops){} template<classOps> Actor* NrootDom<Ops>::copy(Space&home,boolshare){ returnnew(home)NrootDom<Ops>(home,share,*this); } template<classOps> PropCost NrootDom<Ops>::cost(constSpace&,constModEventDelta&med)const{ if(IntView::me(med)==ME_INT_VAL) returnPropCost::unary(PropCost::LO); elseif(IntView::me(med)==ME_INT_DOM) returnPropCost::binary(PropCost::HI); else returnPropCost::binary(PropCost::LO); } template<classOps> ExecStatus NrootDom<Ops>::propagate(Space&home,constModEventDelta&med){ assert(!ops.even()); if((x0.min()>=0)||(x1.min()>=0)) GECODE_REWRITE(*this,(NrootPlusDom<Ops,false>::post(home,x0,x1,ops))); if((x0.max()<=0)||(x1.max()<=0)) GECODE_REWRITE(*this,(NrootPlusDom<Ops,true>::post(home,x0,x1,ops))); if(IntView::me(med)!=ME_INT_DOM){ GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops)); returnx0.assigned()&&x1.assigned()?home.ES_SUBSUMED(*this) :home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM)); } { ViewRanges<IntView>r(x0); RangesMapNroot<Ops>rmn(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapNroot<Ops>,false> m(r,rmn); GECODE_ME_CHECK(x1.inter_r(home,m,false)); } { ViewRanges<IntView>r(x1); RangesMapPow<Ops>rmp(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapPow<Ops>,true> m(r,rmp); GECODE_ME_CHECK(x0.inter_r(home,m,false)); } returnx0.assigned()&&x1.assigned()?home.ES_SUBSUMED(*this):ES_FIX; } }}} //STATISTICS:int-prop