base.hpp /usr/include/gecode/int/no-overlap.hh /usr/include/gecode/int/no-overlap.hh /usr/include/gecode/int/no-overlap/base.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:2011-07-0816:08:27+0200(Fri,08Jul2011)$by$Author:schulte$ *$Revision:12168$ * *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 Base<Box>::Base(Homehome,Box*b0,intn0) :Propagator(home),b(b0),n(n0){ for(inti=n;i--;) b[i].subscribe(home,*this); } template<classBox> forceinlineint Base<Box>::partition(Box*b,inti,intn){ intj=n-1; while(true){ while(!b[j].mandatory()&&(--j>=0)){} while(b[i].mandatory()&&(++i<n)){} if(j<=i)break; std::swap(b[i],b[j]); } returni; } template<classBox> forceinlinesize_t Base<Box>::dispose(Space&home){ for(inti=n;i--;) b[i].cancel(home,*this); (void)Propagator::dispose(home); returnsizeof(*this); } template<classBox> forceinline Base<Box>::Base(Space&home,boolshared,Base<Box>&p,intm) :Propagator(home,shared,p),b(home.alloc<Box>(m)),n(p.n){ for(inti=m;i--;) b[i].update(home,shared,p.b[i]); } template<classBox> PropCost Base<Box>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::quadratic(PropCost::HI,Box::dim()*n); } }}} //STATISTICS:int-prop