ranges-inter.hpp algorithm /usr/include/gecode/iter.hh Gecode::Iter::Ranges::Inter Gecode::Iter::Ranges::NaryInter 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:2012-09-0717:42:21+0200(Fri,07Sep2012)$by$Author:schulte$ *$Revision:13069$ * *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> classInter:publicMinMax{ protected: Ii; Jj; public: Inter(void); Inter(I&i,J&j); voidinit(I&i,J&j); voidoperator ++(void); }; classNaryInter:publicRangeListIter{ protected: RangeList*f; public: NaryInter(void); template<classI> NaryInter(Region&r,I&i); template<classI,classJ> NaryInter(Region&r,I&i,J&j); template<classI> NaryInter(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); NaryInter&operator =(constNaryInter&m); }; /* *Binaryintersection * */ template<classI,classJ> inlinevoid Inter<I,J>::operator ++(void){ if(!i()||!j())gotodone; do{ while(i()&&(i.max()<j.min()))++i; if(!i())gotodone; while(j()&&(j.max()<i.min()))++j; if(!j())gotodone; }while(i.max()<j.min()); //Nowtheintervalsoverlap:consumethesmallerinterval ma=std::min(i.max(),j.max()); mi=std::max(i.min(),j.min()); if(i.max()<j.max())++i;else++j; return; done: finish(); } template<classI,classJ> forceinline Inter<I,J>::Inter(void){} template<classI,classJ> forceinline Inter<I,J>::Inter(I&i0,J&j0) :i(i0),j(j0){ operator ++(); } template<classI,classJ> forceinlinevoid Inter<I,J>::init(I&i0,J&j0){ i=i0;j=j0; operator++(); } /* *Naryintersection * */ forceinline NaryInter::NaryInter(void){} template<classI> forceinlinevoid NaryInter::init(Region&r,I&i){ RangeListIter::init(r); f=NULL; set(copy(i)); } template<classI,classJ> forceinlinevoid NaryInter::init(Region&r,I&i,J&j){ RangeListIter::init(r); f=NULL; RangeList*h; RangeList**c=&h; while(i()&&j()){ do{ while(i()&&(i.max()<j.min()))++i; if(!i())gotodone; while(j()&&(j.max()<i.min()))++j; if(!j())gotodone; }while(i.max()<j.min()); //Nowtheintervalsoverlap:consumethesmallerinterval RangeList*t=range(std::max(i.min(),j.min()), std::min(i.max(),j.max())); *c=t;c=&t->next; if(i.max()<j.max())++i;else++j; } done: *c=NULL; set(h); } template<classI> forceinlinevoid NaryInter::init(Region&r,I*i,intn){ RangeListIter::init(r); f=NULL; if((n>0)&&i[0]()){ RangeList*h; RangeList**c=&h; intmin=i[0].min(); while(i[0]()){ //Initializewithlastinterval intmax=i[0].max(); //Intersectwithallotherintervals restart: for(intj=n;j--;){ //Skipintervalsthataretoosmall while(i[j]()&&(i[j].max()<min)) ++i[j]; if(!i[j]()) gotodone; if(i[j].min()>max){ min=i[j].min(); max=i[j].max(); gotorestart; } //Nowtheintervalsoverlap if(min<i[j].min()) min=i[j].min(); if(max>i[j].max()) max=i[j].max(); } RangeList*t=range(min,max); *c=t;c=&t->next; //Thenextintervalmustbeatleasttwoelementsaway min=max+2; } done: *c=NULL; set(h); } } template<classI> forceinline NaryInter::NaryInter(Region&r,I&i){ init(r,i); } template<classI,classJ> forceinline NaryInter::NaryInter(Region&r,I&i,J&j){ init(r,i,j); } template<classI> forceinline NaryInter::NaryInter(Region&r,I*i,intn){ init(r,i,n); } template<classI> forceinlinevoid NaryInter::operator &=(I&i){ RangeList*j=get(); //Thenewrangelist RangeList*h; RangeList**c=&h; while(i()&&(j!=NULL)){ do{ while(i()&&(i.max()<j->min)) ++i; if(!i())gotodone; while((j!=NULL)&&(j->max<i.min())){ RangeList*t=j->next; j->next=f;f=j; j=t; } if(j==NULL)gotodone; }while(i.max()<j->min); //Nowtheintervalsoverlap:consumethesmallerinterval RangeList*t=range(std::max(i.min(),j->min), std::min(i.max(),j->max),f); *c=t;c=&t->next; if(i.max()<j->max){ ++i; }else{ RangeList*t=j->next; j->next=f;f=j; j=t; } } done: //Putremainingelementsintofreelist while(j!=NULL){ RangeList*t=j->next; j->next=f;f=j; j=t; } *c=NULL; set(h); } forceinlineNaryInter& NaryInter::operator =(constNaryInter&m){ f=NULL; returnstatic_cast<NaryInter&>(RangeListIter::operator =(m)); } }}} //STATISTICS:iter-any