ranges-diff.hpp /usr/include/gecode/iter.hh Gecode::Iter::Ranges::Diff 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:2010-07-2817:35:33+0200(Wed,28Jul2010)$by$Author:schulte$ *$Revision:11294$ * *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{namespaceIter{namespaceRanges{ template<classI,classJ> classDiff:publicMinMax{ protected: Ii; Jj; public: Diff(void); Diff(I&i,J&j); voidinit(I&i,J&j); voidoperator ++(void); }; template<classI,classJ> forceinlinevoid Diff<I,J>::operator ++(void){ //Precondition:mi<=ma //Task:findnextmigreaterthanma while(true){ if(!i())break; mi=ma+1; ma=i.max(); if(mi>i.max()){ ++i; if(!i())break; mi=i.min(); ma=i.max(); } while(j()&&(j.max()<mi)) ++j; if(j()&&(j.min()<=ma)){ //Nowtheinterval[mi...ma]mustbeshrunken //Is[mi...ma]completelyconsumed? if((mi>=j.min())&&(ma<=j.max())) continue; //Does[mi...ma]overlapontheleft? if(j.min()<=mi){ mi=j.max()+1; //Searchformax! ++j; if(j()&&(j.min()<=ma)) ma=j.min()-1; }else{ ma=j.min()-1; } } return; } finish(); } template<classI,classJ> forceinline Diff<I,J>::Diff(void){} template<classI,classJ> forceinline Diff<I,J>::Diff(I&i0,J&j0) :i(i0),j(j0){ if(!i()){ finish(); }else{ mi=i.min()-1;ma=mi; operator ++(); } } template<classI,classJ> forceinlinevoid Diff<I,J>::init(I&i0,J&j0){ i=i0;j=j0; if(!i()){ finish(); }else{ mi=i.min()-1;ma=mi; operator++(); } } }}} //STATISTICS:iter-any