ranges-union.hpp algorithm /usr/include/gecode/iter.hh Gecode::Iter::Ranges::Union Gecode::Iter::Ranges::NaryUnion Gecode Gecode::Iter Gecode::Iter::Ranges /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2004 * *Lastmodified: *$Date:2013-07-1119:23:04+0200(Thu,11Jul2013)$by$Author:schulte$ *$Revision:13866$ * *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. * */ #include<algorithm> namespaceGecode{namespaceIter{namespaceRanges{ template<classI,classJ> classUnion:publicMinMax{ protected: Ii; Jj; public: Union(void); Union(I&i,J&j); voidinit(I&i,J&j); voidoperator ++(void); }; classNaryUnion:publicRangeListIter{ protected: RangeList*f; template<classI,classJ> RangeList*two(I&i,J&j); template<classI> voidinsert(I&i,RangeList*&u); public: NaryUnion(void); template<classI> NaryUnion(Region&r,I&i); template<classI,classJ> NaryUnion(Region&r,I&i,J&j); template<classI> NaryUnion(Region&r,I*i,intn); template<classI> voidinit(Region&r,I&i); template<classI,classJ> voidinit(Region&r,I&i,J&j); template<classI> voidinit(Region&r,I*i,intn); template<classI> voidoperator |=(I&i); NaryUnion&operator =(constNaryUnion&m); }; /* *Binaryunion * */ template<classI,classJ> inlinevoid Union<I,J>::operator ++(void){ if(!i()&&!j()){ finish();return; } if(!i()||(j()&&(j.max()+1<i.min()))){ mi=j.min();ma=j.max();++j;return; } if(!j()||(i()&&(i.max()+1<j.min()))){ mi=i.min();ma=i.max();++i;return; } mi=std::min(i.min(),j.min()); ma=std::max(i.max(),j.max()); ++i;++j; next: if(i()&&(i.min()<=ma+1)){ ma=std::max(ma,i.max());++i; gotonext; } if(j()&&(j.min()<=ma+1)){ ma=std::max(ma,j.max());++j; gotonext; } } template<classI,classJ> forceinline Union<I,J>::Union(void){} template<classI,classJ> forceinline Union<I,J>::Union(I&i0,J&j0) :i(i0),j(j0){ operator ++(); } template<classI,classJ> forceinlinevoid Union<I,J>::init(I&i0,J&j0){ i=i0;j=j0; operator++(); } /* *Naryunion * */ template<classI,classJ> RangeListIter::RangeList* NaryUnion::two(I&i,J&j){ RangeList*h; RangeList**c=&h; while(i()&&j()) if(i.max()+1<j.min()){ RangeList*t=range(i);++i; *c=t;c=&t->next; }elseif(j.max()+1<i.min()){ RangeList*t=range(j);++j; *c=t;c=&t->next; }else{ intmin=std::min(i.min(),j.min()); intmax=std::max(i.max(),j.max()); ++i;++j; nexta: if(i()&&(i.min()<=max+1)){ max=std::max(max,i.max());++i; gotonexta; } if(j()&&(j.min()<=max+1)){ max=std::max(max,j.max());++j; gotonexta; } RangeList*t=range(min,max); *c=t;c=&t->next; } for(;i();++i){ RangeList*t=range(i); *c=t;c=&t->next; } for(;j();++j){ RangeList*t=range(j); *c=t;c=&t->next; } *c=NULL; returnh; } template<classI> void NaryUnion::insert(I&i,RangeList*&u){ //Thecurrentrangelist RangeList**c=&u; while((*c!=NULL)&&i()) if((*c)->max+1<i.min()){ //Keeprangefromunion c=&(*c)->next; }elseif(i.max()+1<(*c)->min){ //Copyrangefromiterator RangeList*t=range(i,f);++i; //Insert t->next=*c;*c=t;c=&t->next; }else{ //Rangesoverlap //Computenewminimum (*c)->min=std::min((*c)->min,i.min()); //Computenewmaximum intmax=std::max((*c)->max,i.max()); //Scanfromthenextrangeintheunion RangeList*s=(*c)->next; ++i; nextb: if((s!=NULL)&&(s->min<=max+1)){ max=std::max(max,s->max); RangeList*t=s; s=s->next; //Putdeletedelementintofreelist t->next=f;f=t; gotonextb; } if(i()&&(i.min()<=max+1)){ max=std::max(max,i.max());++i; gotonextb; } //Storecomputedmaxandshuntskippedrangesfromunion (*c)->max=max;(*c)->next=s; } if(*c==NULL){ //Copyremainingrangesfromiterator for(;i();++i){ RangeList*t=range(i,f); *c=t;c=&t->next; } *c=NULL; } } forceinline NaryUnion::NaryUnion(void) :f(NULL){} template<classI> forceinlinevoid NaryUnion::init(Region&r,I&i){ RangeListIter::init(r); f=NULL; set(copy(i)); } template<classI,classJ> forceinlinevoid NaryUnion::init(Region&r,I&i,J&j){ RangeListIter::init(r); f=NULL; set(two(i,j)); } template<classI> forceinlinevoid NaryUnion::init(Region&r,I*i,intn){ f=NULL; RangeListIter::init(r); intm=0; while((m<n)&&!i[m]()) m++; //Unionisempty if(m>=n) return; n--; while(!i[n]()) n--; if(m==n){ //Unionisjustasingleiterator set(copy(i[m])); }else{ //Atleasttwoiterators RangeList*u=two(i[m++],i[n--]); //Inserttheremainingiterators for(;m<=n;m++) insert(i[m],u); set(u); } } template<classI> forceinline NaryUnion::NaryUnion(Region&r,I&i){ init(r,i); } template<classI,classJ> forceinline NaryUnion::NaryUnion(Region&r,I&i,J&j){ init(r,i,j); } template<classI> forceinline NaryUnion::NaryUnion(Region&r,I*i,intn){ init(r,i,n); } template<classI> forceinlinevoid NaryUnion::operator |=(I&i){ RangeList*u=get(); insert(i,u); set(u); } forceinlineNaryUnion& NaryUnion::operator =(constNaryUnion&m){ f=NULL; returnstatic_cast<NaryUnion&>(RangeListIter::operator =(m)); } }}} //STATISTICS:iter-any