link-multi.hpp /usr/include/gecode/int/channel.hh /usr/include/gecode/int/channel/link-multi.hpp /usr/include/gecode/int/channel.hh Gecode Gecode::Int Gecode::Int::Channel /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2007 * *Lastmodified: *$Date:2011-10-3113:02:28+0100(Mon,31Oct2011)$by$Author:schulte$ *$Revision:12450$ * *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{namespaceInt{namespaceChannel{ forceinline LinkMulti::LinkMulti(Homehome,ViewArray<BoolView>&x,IntViewy,into0) :MixNaryOnePropagator<BoolView,PC_BOOL_NONE,IntView,PC_INT_DOM> (home,x,y),c(home),status(S_NONE),o(o0){ x.subscribe(home,*new(home)Advisor(home,*this,c)); //Propagatorisscheduledbecauseofthedependencysubscription } forceinlineExecStatus LinkMulti::post(Homehome,ViewArray<BoolView>&x,IntViewy,into){ intn=x.size(); GECODE_ME_CHECK(y.gq(home,o)); GECODE_ME_CHECK(y.lq(home,o+n-1)); assert(n>0); if(n==1){ GECODE_ME_CHECK(x[0].one(home)); assert(y.val()==o); }elseif(y.assigned()){ intj=y.val()-o; GECODE_ME_CHECK(x[j].one(home)); for(inti=0;i<j;i++) GECODE_ME_CHECK(x[i].zero(home)); for(inti=j+1;i<n;i++) GECODE_ME_CHECK(x[i].zero(home)); }else{ for(inti=n;i--;) if(x[i].one()){ for(intj=0;j<i;j++) GECODE_ME_CHECK(x[j].zero(home)); for(intj=i+1;j<n;j++) GECODE_ME_CHECK(x[j].zero(home)); GECODE_ME_CHECK(y.eq(home,o+i)); returnES_OK; }elseif(x[i].zero()){ GECODE_ME_CHECK(y.nq(home,o+i)); } (void)new(home)LinkMulti(home,x,y,o); } returnES_OK; } }}} //STATISTICS:int-prop