val-set.hpp /usr/include/gecode/int/val-set.hh /usr/include/gecode/int/member.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/val-set.hpp /usr/include/gecode/int/val-set.hh Gecode Gecode::Int /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2011 * *Lastmodified: *$Date:2011-08-2221:43:31+0200(Mon,22Aug2011)$by$Author:schulte$ *$Revision:12335$ * *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{ /* *Valuesets * */ forceinline ValSet::ValSet(void) :fst(NULL),lst(NULL),n(0){} forceinlinevoid ValSet::add(Space&home,intv){ RangeList*c=fst; RangeList**p=&fst; while(c!=NULL){ if(v<c->min()){ if(v+1==c->min()){ c->min(v);n++; return; }else{ *p=new(home)RangeList(v,v,c);n++; return; } }elseif(v<=c->max()){ //Valuealreadyincluded return; }elseif(v==c->max()+1){ if((c->next()!=NULL)&&(v+1==c->next()->min())){ c->next()->min(c->min()); *p=c->next(); c->dispose(home,c); }else{ c->max(v); } n++; return; }else{ //FIXME:HOWTOCASTHERE? p=reinterpret_cast<RangeList**>(c->nextRef()); c=*p; } } *p=new(home)RangeList(v,v,NULL);n++; lst=*p; } forceinlineint ValSet::size(void)const{ returnn; } forceinlinebool ValSet::empty(void)const{ returnn==0; } forceinlineint ValSet::min(void)const{ returnfst->min(); } forceinlineint ValSet::max(void)const{ returnlst->max(); } forceinlinevoid ValSet::update(Space&home,boolshare,ValSet&vs){ (void)share; if(vs.n>0){ n=vs.n; //Countnumberofranges intm=0; for(RangeList*c=vs.fst;c!=NULL;c=c->next()) m++; fst=home.alloc<RangeList>(m); lst=fst+(m-1); inti=0; for(RangeList*c=vs.fst;c!=NULL;c=c->next()){ fst[i].min(c->min());fst[i].max(c->max()); fst[i].next(fst+i+1); i++; } lst->next(NULL); } } forceinlinevoid ValSet::flush(void){ fst=lst=NULL; } forceinlinevoid ValSet::dispose(Space&home){ if(fst!=NULL) fst->dispose(home,lst); } forceinline ValSet::Ranges::Ranges(constValSet&vs) :c(vs.fst){} forceinlinebool ValSet::Ranges::operator ()(void)const{ returnc!=NULL; } forceinlinevoid ValSet::Ranges::operator ++(void){ c=c->next(); } forceinlineint ValSet::Ranges::min(void)const{ returnc->min(); } forceinlineint ValSet::Ranges::max(void)const{ returnc->max(); } forceinlineunsignedint ValSet::Ranges::width(void)const{ returnc->width(); } template<classView> forceinlineIter::Ranges::CompareStatus ValSet::compare(Viewx)const{ if(empty()||(x.max()<min())||(x.min()>max())) returnIter::Ranges::CS_DISJOINT; ValSet::Rangesvsr(*this); ViewRanges<View>xr(x); returnIter::Ranges::compare(xr,vsr); } template<classView> forceinlinebool ValSet::subset(Viewx)const{ if(empty()||(x.min()<min())||(x.max()>max())) returnfalse; ValSet::Rangesvsr(*this); ViewRanges<View>xr(x); returnIter::Ranges::subset(xr,vsr); } }} //STATISTICS:int-other