ite.hpp gecode/int/rel.hh algorithm /usr/include/gecode/int/bool.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 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 /usr/include/gecode/int/bool/ite.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/gcc/post.hpp /usr/include/gecode/int/bool.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/bool/ite.hpp /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 Gecode::Int Gecode::Int::Bool /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2013 * *Lastmodified: *$Date:2013-04-2920:52:35+0200(Mon,29Apr2013)$by$Author:schulte$ *$Revision:13590$ * *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<algorithm> namespaceGecode{namespaceInt{namespaceBool{ template<classView,PropCondpc> forceinline IteBase<View,pc>::IteBase(Homehome,BoolViewb0,Viewy0,Viewy1,Viewy2) :Propagator(home),b(b0),x0(y0),x1(y1),x2(y2){ b.subscribe(home,*this,PC_BOOL_VAL); x0.subscribe(home,*this,pc); x1.subscribe(home,*this,pc); x2.subscribe(home,*this,pc); } template<classView,PropCondpc> forceinline IteBase<View,pc>::IteBase(Space&home,boolshare,IteBase<View,pc>&p) :Propagator(home,share,p){ b.update(home,share,p.b); x0.update(home,share,p.x0); x1.update(home,share,p.x1); x2.update(home,share,p.x2); } template<classView,PropCondpc> PropCost IteBase<View,pc>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::ternary(PropCost::LO); } template<classView,PropCondpc> forceinlinesize_t IteBase<View,pc>::dispose(Space&home){ b.cancel(home,*this,PC_BOOL_VAL); x0.cancel(home,*this,pc); x1.cancel(home,*this,pc); x2.cancel(home,*this,pc); (void)Propagator::dispose(home); returnsizeof(*this); } template<classView> forceinline IteBnd<View>::IteBnd(Homehome,BoolViewb,Viewx0,Viewx1,Viewx2) :IteBase<View,PC_INT_BND>(home,b,x0,x1,x2){} template<classView> forceinline IteBnd<View>::IteBnd(Space&home,boolshare,IteBnd<View>&p) :IteBase<View,PC_INT_BND>(home,share,p){} template<classView> Actor* IteBnd<View>::copy(Space&home,boolshare){ returnnew(home)IteBnd<View>(home,share,*this); } template<classView> inlineExecStatus IteBnd<View>::post(Homehome,BoolViewb,Viewx0,Viewx1,Viewx2){ if(same(x0,x1)||b.one()) returnRel::EqBnd<View,View>::post(home,x2,x0); if(b.zero()) returnRel::EqBnd<View,View>::post(home,x2,x1); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); GECODE_ME_CHECK(x2.gq(home,std::min(x0.min(),x1.min()))); (void)new(home)IteBnd<View>(home,b,x0,x1,x2); returnES_OK; } template<classView> ExecStatus IteBnd<View>::propagate(Space&home,constModEventDelta&){ if(b.one()) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x2,x0))); if(b.zero()) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x2,x1))); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); GECODE_ME_CHECK(x2.gq(home,std::min(x0.min(),x1.min()))); RelTesteq20=rtest_eq_bnd(x2,x0); RelTesteq21=rtest_eq_bnd(x2,x1); if((eq20==RT_FALSE)&&(eq21==RT_FALSE)) returnES_FAILED; if(eq20==RT_FALSE){ GECODE_ME_CHECK(b.zero_none(home)); if(eq21==RT_TRUE) returnhome.ES_SUBSUMED(*this); else GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x2,x1))); } if(eq21==RT_FALSE){ GECODE_ME_CHECK(b.one_none(home)); if(eq20==RT_TRUE) returnhome.ES_SUBSUMED(*this); else GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x2,x0))); } if((eq20==RT_TRUE)&&(eq21==RT_TRUE)) returnhome.ES_SUBSUMED(*this); returnES_FIX; } template<classView> forceinline IteDom<View>::IteDom(Homehome,BoolViewb,Viewx0,Viewx1,Viewx2) :IteBase<View,PC_INT_DOM>(home,b,x0,x1,x2){} template<classView> forceinline IteDom<View>::IteDom(Space&home,boolshare,IteDom<View>&p) :IteBase<View,PC_INT_DOM>(home,share,p){} template<classView> Actor* IteDom<View>::copy(Space&home,boolshare){ returnnew(home)IteDom<View>(home,share,*this); } template<classView> inlineExecStatus IteDom<View>::post(Homehome,BoolViewb,Viewx0,Viewx1,Viewx2){ if(same(x0,x1)||b.one()) returnRel::EqDom<View,View>::post(home,x2,x0); if(b.zero()) returnRel::EqDom<View,View>::post(home,x2,x1); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); GECODE_ME_CHECK(x2.gq(home,std::min(x0.min(),x1.min()))); (void)new(home)IteDom<View>(home,b,x0,x1,x2); returnES_OK; } template<classView> PropCost IteDom<View>::cost(constSpace&,constModEventDelta&med)const{ if(View::me(med)==ME_INT_DOM) returnPropCost::ternary(PropCost::HI); else returnPropCost::ternary(PropCost::LO); } template<classView> ExecStatus IteDom<View>::propagate(Space&home,constModEventDelta&med){ if(b.one()) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x2,x0))); if(b.zero()) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x2,x1))); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); GECODE_ME_CHECK(x2.gq(home,std::min(x0.min(),x1.min()))); if(View::me(med)!=ME_INT_DOM){ RelTesteq20=rtest_eq_bnd(x2,x0); RelTesteq21=rtest_eq_bnd(x2,x1); if((eq20==RT_FALSE)&&(eq21==RT_FALSE)) returnES_FAILED; if(eq20==RT_FALSE){ GECODE_ME_CHECK(b.zero_none(home)); if(eq21==RT_TRUE) returnhome.ES_SUBSUMED(*this); else GECODE_REWRITE(*this, (Rel::EqDom<View,View>::post(home(*this),x2,x1))); } if(eq21==RT_FALSE){ GECODE_ME_CHECK(b.one_none(home)); if(eq20==RT_TRUE) returnhome.ES_SUBSUMED(*this); else GECODE_REWRITE(*this, (Rel::EqDom<View,View>::post(home(*this),x2,x0))); } if((eq20==RT_TRUE)&&(eq21==RT_TRUE)) returnhome.ES_SUBSUMED(*this); returnhome.ES_FIX_PARTIAL(*this,View::med(ME_INT_DOM)); } RelTesteq20=rtest_eq_dom(x2,x0); RelTesteq21=rtest_eq_dom(x2,x1); if((eq20==RT_FALSE)&&(eq21==RT_FALSE)) returnES_FAILED; if(eq20==RT_FALSE){ GECODE_ME_CHECK(b.zero_none(home)); if(eq21==RT_TRUE) returnhome.ES_SUBSUMED(*this); else GECODE_REWRITE(*this, (Rel::EqDom<View,View>::post(home(*this),x2,x1))); } if(eq21==RT_FALSE){ GECODE_ME_CHECK(b.one_none(home)); if(eq20==RT_TRUE) returnhome.ES_SUBSUMED(*this); else GECODE_REWRITE(*this, (Rel::EqDom<View,View>::post(home(*this),x2,x0))); } assert((eq20!=RT_TRUE)||(eq21!=RT_TRUE)); ViewRanges<View>r0(x0),r1(x1); Iter::Ranges::Union<ViewRanges<View>,ViewRanges<View>>u(r0,r1); if(!same(x0,x2)&&!same(x1,x2)) GECODE_ME_CHECK(x2.inter_r(home,u,false)); else GECODE_ME_CHECK(x2.inter_r(home,u,true)); returnES_FIX; } }}} //STATISTICS:int-prop