divmod.hpp gecode/int/linear.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 gecode/int/linear/post.hpp cmath cassert gecode/kernel/brancher-view-sel.hpp gecode/kernel/allocators.hpp gecode/int/linear/int-noview.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/int/linear/bool-scale.hpp gecode/support/int-type.hpp gecode/iter/values-positive.hpp cfloat gecode/int/exception.hpp gecode/support/exception.hpp exception gecode/int/bool/or.hpp gecode/int/bool/eq.hpp 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/int/linear/int-bin.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/int/bool.hh gecode/int/bool/clause.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/linear/int-ter.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/int/bool/base.hpp gecode/iter/values-array.hpp gecode/int/branch/var.hpp gecode/iter/ranges-singleton.hpp gecode/int/bool/ite.hpp vector gecode/int/rel/lex.hpp gecode/int/linear/int-nary.hpp gecode/int/view/print.hpp gecode/kernel/advisor.hpp gecode/int/linear/bool-int.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/int/bool/eqv.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/int/bool/lq.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/int/linear/bool-view.hpp 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 /usr/include/gecode/int/arithmetic/divmod.hpp gecode/int/linear.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/int/linear/int-dom.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/divmod.hpp Gecode Gecode::Int Gecode::Int::Arithmetic /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> * *Copyright: *GuidoTack,2008 * *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. * */ #include<gecode/int/linear.hh> namespaceGecode{namespaceInt{namespaceArithmetic{ /* *Positiveboundsconsistentdivision * */ template<classVA,classVB,classVC> forceinline DivPlusBnd<VA,VB,VC>::DivPlusBnd(Homehome,VAx0,VBx1,VCx2) :MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND> (home,x0,x1,x2){} template<classVA,classVB,classVC> forceinline DivPlusBnd<VA,VB,VC>::DivPlusBnd(Space&home,boolshare, DivPlusBnd<VA,VB,VC>&p) :MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND> (home,share,p){} template<classVA,classVB,classVC> Actor* DivPlusBnd<VA,VB,VC>::copy(Space&home,boolshare){ returnnew(home)DivPlusBnd<VA,VB,VC>(home,share,*this); } template<classVA,classVB,classVC> ExecStatus DivPlusBnd<VA,VB,VC>::propagate(Space&home,constModEventDelta&){ assert(pos(x0)&&pos(x1)&&!neg(x2)); boolmod; do{ mod=false; GECODE_ME_CHECK_MODIFIED(mod,x2.lq(home, floor_div_pp(x0.max(),x1.min()))); GECODE_ME_CHECK_MODIFIED(mod,x2.gq(home, floor_div_px(x0.min(),x1.max()))); GECODE_ME_CHECK_MODIFIED(mod,x0.le(home,mll(x1.max(),ill(x2.max())))); GECODE_ME_CHECK_MODIFIED(mod,x0.gq(home,mll(x1.min(),x2.min()))); if(x2.min()>0){ GECODE_ME_CHECK_MODIFIED(mod, x1.lq(home,floor_div_pp(x0.max(),x2.min()))); } GECODE_ME_CHECK_MODIFIED(mod,x1.gq(home,ceil_div_pp(ll(x0.min()), ill(x2.max())))); }while(mod); returnx0.assigned()&&x1.assigned()? home.ES_SUBSUMED(*this):ES_FIX; } template<classVA,classVB,classVC> forceinlineExecStatus DivPlusBnd<VA,VB,VC>::post(Homehome,VAx0,VBx1,VCx2){ GECODE_ME_CHECK(x0.gr(home,0)); GECODE_ME_CHECK(x1.gr(home,0)); GECODE_ME_CHECK(x2.gq(home,floor_div_pp(x0.min(),x1.max()))); (void)new(home)DivPlusBnd<VA,VB,VC>(home,x0,x1,x2); returnES_OK; } /* *Boundsconsistentdivision * */ template<classView> forceinline DivBnd<View>::DivBnd(Homehome,Viewx0,Viewx1,Viewx2) :TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2){} template<classView> forceinline DivBnd<View>::DivBnd(Space&home,boolshare,DivBnd<View>&p) :TernaryPropagator<View,PC_INT_BND>(home,share,p){} template<classView> Actor* DivBnd<View>::copy(Space&home,boolshare){ returnnew(home)DivBnd<View>(home,share,*this); } template<classView> ExecStatus DivBnd<View>::propagate(Space&home,constModEventDelta&){ if(pos(x1)){ if(pos(x2)||pos(x0))gotorewrite_ppp; if(neg(x2)||neg(x0))gotorewrite_npn; gotoprop_xpx; } if(neg(x1)){ if(neg(x2)||pos(x0))gotorewrite_pnn; if(pos(x2)||neg(x0))gotorewrite_nnp; gotoprop_xnx; } if(pos(x2)){ if(pos(x0))gotorewrite_ppp; if(neg(x0))gotorewrite_nnp; gotoprop_xxp; } if(neg(x2)){ if(pos(x0))gotorewrite_pnn; if(neg(x0))gotorewrite_npn; gotoprop_xxn; } assert(any(x1)&&any(x2)); GECODE_ME_CHECK(x0.lq(home,std::max(mll(x1.max(),ill(x2.max()))-1, mll(x1.min(),dll(x2.min()))-1))); GECODE_ME_CHECK(x0.gq(home,std::min(mll(x1.min(),ill(x2.max())), mll(x1.max(),dll(x2.min()))))); returnES_NOFIX; prop_xxp: assert(any(x0)&&any(x1)&&pos(x2)); GECODE_ME_CHECK(x0.le(home,mll(x1.max(),ill(x2.max())))); GECODE_ME_CHECK(x0.gq(home,mll(x1.min(),ill(x2.max())))); if(pos(x0))gotorewrite_ppp; if(neg(x0))gotorewrite_nnp; GECODE_ME_CHECK(x1.lq(home,floor_div_pp(x0.max(),x2.min()))); GECODE_ME_CHECK(x1.gq(home,ceil_div_xp(x0.min(),x2.min()))); if(x0.assigned()&&x1.assigned()) gotosubsumed; returnES_NOFIX; prop_xpx: assert(any(x0)&&pos(x1)&&any(x2)); GECODE_ME_CHECK(x0.le(home,mll(x1.max(),ill(x2.max())))); GECODE_ME_CHECK(x0.gq(home,mll(x1.max(),dll(x2.min())))); if(pos(x0))gotorewrite_ppp; if(neg(x0))gotorewrite_npn; GECODE_ME_CHECK(x2.lq(home,floor_div_xp(x0.max(),x1.min()))); GECODE_ME_CHECK(x2.gq(home,floor_div_xp(x0.min(),x1.min()))); if(x0.assigned()&&x1.assigned()) gotosubsumed; returnES_NOFIX; prop_xxn: assert(any(x0)&&any(x1)&&neg(x2)); GECODE_ME_CHECK(x0.lq(home,mll(x1.min(),dll(x2.min())))); GECODE_ME_CHECK(x0.gq(home,mll(x1.max(),dll(x2.min())))); if(pos(x0))gotorewrite_pnn; if(neg(x0))gotorewrite_npn; if(x2.max()!=-1) GECODE_ME_CHECK(x1.lq(home,ceil_div_xx(ll(x0.min()),ill(x2.max())))); if(x2.max()!=-1) GECODE_ME_CHECK(x1.gq(home,ceil_div_xx(ll(x0.max()),ill(x2.max())))); if(x0.assigned()&&x1.assigned()) gotosubsumed; returnES_NOFIX; prop_xnx: assert(any(x0)&&neg(x1)&&any(x2)); GECODE_ME_CHECK(x0.lq(home,mll(x1.min(),dll(x2.min())))); GECODE_ME_CHECK(x0.gq(home,mll(x1.min(),ill(x2.max())))); if(pos(x0))gotorewrite_pnn; if(neg(x0))gotorewrite_nnp; GECODE_ME_CHECK(x2.lq(home,floor_div_xx(x0.min(),x1.max()))); GECODE_ME_CHECK(x2.gq(home,floor_div_xx(x0.max(),x1.max()))); if(x0.assigned()&&x1.assigned()) gotosubsumed; returnES_NOFIX; rewrite_ppp: GECODE_REWRITE(*this,(DivPlusBnd<IntView,IntView,IntView> ::post(home(*this),x0,x1,x2))); rewrite_nnp: GECODE_REWRITE(*this,(DivPlusBnd<MinusView,MinusView,IntView> ::post(home(*this),MinusView(x0),MinusView(x1),x2))); rewrite_pnn: GECODE_REWRITE(*this,(DivPlusBnd<IntView,MinusView,MinusView> ::post(home(*this),x0,MinusView(x1),MinusView(x2)))); rewrite_npn: GECODE_REWRITE(*this,(DivPlusBnd<MinusView,IntView,MinusView> ::post(home(*this),MinusView(x0),x1,MinusView(x2)))); subsumed: assert(x0.assigned()&&x1.assigned()); intresult=std::abs(x0.val())/std::abs(x1.val()); if(x0.val()/x1.val()<0) result=-result; GECODE_ME_CHECK(x2.eq(home,result)); returnhome.ES_SUBSUMED(*this); } template<classView> ExecStatus DivBnd<View>::post(Homehome,Viewx0,Viewx1,Viewx2){ GECODE_ME_CHECK(x1.nq(home,0)); if(pos(x0)){ if(pos(x1)||pos(x2))gotopost_ppp; if(neg(x1)||neg(x2))gotopost_pnn; }elseif(neg(x0)){ if(neg(x1)||pos(x2))gotopost_nnp; if(pos(x1)||neg(x2))gotopost_npn; }elseif(pos(x1)){ if(pos(x2))gotopost_ppp; if(neg(x2))gotopost_npn; }elseif(neg(x1)){ if(pos(x2))gotopost_nnp; if(neg(x2))gotopost_pnn; } (void)new(home)DivBnd<View>(home,x0,x1,x2); returnES_OK; post_ppp: returnDivPlusBnd<IntView,IntView,IntView> ::post(home,x0,x1,x2); post_nnp: returnDivPlusBnd<MinusView,MinusView,IntView> ::post(home,MinusView(x0),MinusView(x1),x2); post_pnn: returnDivPlusBnd<IntView,MinusView,MinusView> ::post(home,x0,MinusView(x1),MinusView(x2)); post_npn: returnDivPlusBnd<MinusView,IntView,MinusView> ::post(home,MinusView(x0),x1,MinusView(x2)); } /* *Propagatorforx0!=0/\(x1!=0=>x0*x1>0)/\abs(x1)<abs(x0) * */ template<classView> forceinline DivMod<View>::DivMod(Homehome,Viewx0,Viewx1,Viewx2) :TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2){} template<classView> forceinlineExecStatus DivMod<View>::post(Homehome,Viewx0,Viewx1,Viewx2){ GECODE_ME_CHECK(x1.nq(home,0)); (void)new(home)DivMod<View>(home,x0,x1,x2); returnES_OK; } template<classView> forceinline DivMod<View>::DivMod(Space&home,boolshare,DivMod<View>&p) :TernaryPropagator<View,PC_INT_BND>(home,share,p){} template<classView> Actor* DivMod<View>::copy(Space&home,boolshare){ returnnew(home)DivMod<View>(home,share,*this); } template<classView> ExecStatus DivMod<View>::propagate(Space&home,constModEventDelta&){ boolsignIsSame; do{ signIsSame=true; //Thesignofx0andx2isthesame if(x0.min()>=0){ GECODE_ME_CHECK(x2.gq(home,0)); }elseif(x0.max()<=0){ GECODE_ME_CHECK(x2.lq(home,0)); }elseif(x2.min()>0){ GECODE_ME_CHECK(x0.gq(home,0)); }elseif(x2.max()<0){ GECODE_ME_CHECK(x0.lq(home,0)); }else{ signIsSame=false; } //abs(x2)islessthanabs(x1) intx1max=std::max(x1.max(),std::max(-x1.max(), std::max(x1.min(),-x1.min()))); GECODE_ME_CHECK(x2.le(home,x1max)); GECODE_ME_CHECK(x2.gr(home,-x1max)); intx2absmin=any(x2)?0:(pos(x2)?x2.min():-x2.max()); Iter::Ranges::Singletonsr(-x2absmin,x2absmin); GECODE_ME_CHECK(x1.minus_r(home,sr,false)); }while(!signIsSame&& (x0.min()>0||x0.max()<0||x2.min()>0||x2.max()<0)); if(signIsSame){ intx2max=std::max(x2.max(),std::max(-x2.max(), std::max(x2.min(),-x2.min()))); intx1absmin=any(x1)?0:(pos(x1)?x1.min():-x1.max()); if(x2max<x1absmin) returnhome.ES_SUBSUMED(*this); } returnES_FIX; } }}} //STATISTICS:int-prop