opt.hpp /usr/include/gecode/int/no-overlap.hh /usr/include/gecode/int/no-overlap.hh /usr/include/gecode/int/no-overlap/opt.hpp Gecode Gecode::Int Gecode::Int::NoOverlap /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2011 * *Lastmodified: *$Date:2012-10-2221:13:52+0200(Mon,22Oct2012)$by$Author:schulte$ *$Revision:13163$ * *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{namespaceNoOverlap{ template<classBox> forceinline OptProp<Box>::OptProp(Homehome,Box*b,intn,intm0) :Base<Box>(home,b,n),m(m0){ for(inti=m;i--;) b[n+i].subscribe(home,*this); } template<classBox> ExecStatus OptProp<Box>::post(Homehome,Box*b,intn){ //Partitionintomandatoryandoptionalboxes if(n>1){ intp=Base<Box>::partition(b,0,n); (void)new(home)OptProp<Box>(home,b,p,n-p); } returnES_OK; } template<classBox> forceinlinesize_t OptProp<Box>::dispose(Space&home){ for(inti=m;i--;) b[n+i].cancel(home,*this); (void)Base<Box>::dispose(home); returnsizeof(*this); } template<classBox> forceinline OptProp<Box>::OptProp(Space&home,boolshared,OptProp<Box>&p) :Base<Box>(home,shared,p,p.n+p.m),m(p.m){} template<classBox> Actor* OptProp<Box>::copy(Space&home,boolshare){ returnnew(home)OptProp<Box>(home,share,*this); } template<classBox> ExecStatus OptProp<Box>::propagate(Space&home,constModEventDelta&med){ Regionr(home); if(BoolView::me(med)==ME_BOOL_VAL){ //Eliminateexcludedboxes for(inti=m;i--;) if(b[n+i].excluded()){ b[n+i].cancel(home,*this); b[n+i]=b[n+(--m)]; } //Reconsideroptionalboxes if(m>0){ intp=Base<Box>::partition(b+n,0,m); n+=p;m-=p; } } //Numberofdisjointboxes int*db=r.alloc<int>(n); for(inti=n;i--;) db[i]=n-1; //Numberofboxestobeeliminated inte=0; for(inti=n;i--;){ assert(b[i].mandatory()); for(intj=i;j--;) if(b[i].nooverlap(b[j])){ assert(db[i]>0);assert(db[j]>0); if(--db[i]==0)e++; if(--db[j]==0)e++; continue; }else{ GECODE_ES_CHECK(b[i].nooverlap(home,b[j])); } } if(m==0){ if(e==n) returnhome.ES_SUBSUMED(*this); inti=n-1; while(e>0){ //Eliminateboxesthatdonotoverlap while(db[i]>0) i--; b[i].cancel(home,*this); b[i]=b[--n];b[n]=b[n+m]; e--;i--; } if(n<2) returnhome.ES_SUBSUMED(*this); } //Checkwhethersomeoptionalboxesmustbeexcluded for(inti=m;i--;){ if(b[n+i].optional()){ for(intj=n;j--;) if(b[n+i].overlap(b[j])){ GECODE_ES_CHECK(b[n+i].exclude(home)); b[n+i].cancel(home,*this); b[n+i]=b[n+(--m)]; break; } }else{ //ThismightbethecaseifthesameBooleanviewoccurs //severaltimesandhasalreadybeenexcluded assert(b[n+i].excluded()); b[n+i].cancel(home,*this); b[n+i]=b[n+(--m)]; } } returnES_NOFIX; } }}} //STATISTICS:int-prop