base.hpp /usr/include/gecode/int/extensional.hh /usr/include/gecode/int/extensional/base.hpp /usr/include/gecode/int/extensional.hh Gecode Gecode::Int Gecode::Int::Extensional GECODE_LAST_TUPLE l (*(l)) /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *MikaelLagerkvist<lagerkvist@gecode.org> * *Contributingauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *MikaelLagerkvist,2007 *ChristianSchulte,2008 * *Lastmodified: *$Date:2012-07-1908:53:57+0200(Thu,19Jul2012)$by$Author:tack$ *$Revision:12963$ * *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{namespaceExtensional{ /* *Thepropagatorproper * */ template<classView,boolsubscribe> forceinline Base<View,subscribe>::Base(Homehome,ViewArray<View>&x0, constTupleSet&t) :Propagator(home),x(x0),tupleSet(t),last_data(NULL){ if(subscribe) x.subscribe(home,*this,PC_INT_DOM); assert(ts()->finalized()); init_last(home,ts()->last,ts()->tuple_data); home.notice(*this,AP_DISPOSE); } template<classView,boolsubscribe> forceinline Base<View,subscribe>::Base(Space&home,boolshare,Base<View,subscribe>&p) :Propagator(home,share,p),last_data(NULL){ x.update(home,share,p.x); tupleSet.update(home,share,p.tupleSet); init_last(home,p.last_data,p.ts()->tuple_data); } template<classView,boolsubscribe> forceinlinevoid Base<View,subscribe>::init_last(Space&home,Tuple**source,Tuple*base){ if(last_data==NULL){ intliterals=static_cast<int>(ts()->domsize*x.size()); last_data=home.alloc<Tuple*>(literals); for(inti=literals;i--;) last_data[i]=ts()->tuple_data+(source[i]-base); } } template<classView,boolsubscribe> forceinlineTupleSet::TupleSetI* Base<View,subscribe>::ts(void){ returntupleSet.implementation(); } template<classView,boolsubscribe> PropCost Base<View,subscribe>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::quadratic(PropCost::HI,x.size()); } #defineGECODE_LAST_TUPLE(l)(*(l)) template<classView,boolsubscribe> forceinlineTuple Base<View,subscribe>::last(inti,intn){ returnGECODE_LAST_TUPLE(last_data[(i*ts()->domsize)+n]); } template<classView,boolsubscribe> forceinlineTuple Base<View,subscribe>::last_next(inti,intn){ assert(last(i,n)!=NULL); assert(last(i,n)[i]==n+ts()->min); intpos=(i*static_cast<int>(ts()->domsize))+n; ++(last_data[pos]); if(last(i,n)[i]!=(n+ts()->min)) last_data[pos]=ts()->nullpointer; returnlast(i,n); } template<classView,boolsubscribe> forceinlinevoid Base<View,subscribe>::init_dom(Space&home,Domaindom){ unsignedintdomsize=ts()->domsize; for(inti=x.size();i--;){ dom[i].init(home,domsize); for(ViewValues<View>vv(x[i]);vv();++vv) dom[i].set(static_cast<unsignedint>(vv.val()-ts()->min)); } } template<classView,boolsubscribe> forceinlinebool Base<View,subscribe>::valid(Tuplet,Domaindom){ for(inti=x.size();i--;) if(!dom[i].get(static_cast<unsignedint>(t[i]-ts()->min))) returnfalse; returntrue; } #undefGECODE_LAST_TUPLE template<classView,boolsubscribe> forceinlineTuple Base<View,subscribe>::find_support(Domaindom,inti,intn){ Tuplel=last(i,n); while((l!=NULL)&&!valid(l,dom)) l=last_next(i,n); returnl; } template<classView,boolsubscribe> forceinlinesize_t Base<View,subscribe>::dispose(Space&home){ home.ignore(*this,AP_DISPOSE); (void)Propagator::dispose(home); if(subscribe) x.cancel(home,*this,PC_INT_DOM); //takecareoflast_data unsignedintliterals=ts()->domsize*x.size(); home.rfree(last_data,sizeof(Tuple*)*literals); (void)tupleSet.~TupleSet(); returnsizeof(*this); } }}} //STATISTICS:int-prop