ranges-append.hpp /usr/include/gecode/iter.hh Gecode::Iter::Ranges::Append Gecode::Iter::Ranges::NaryAppend 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> classAppend:publicMinMax{ protected: Ii; Jj; public: Append(void); Append(I&i,J&j); voidinit(I&i,J&j); voidoperator ++(void); }; template<classI> classNaryAppend:publicMinMax{ protected: I*r; intn; intactive; public: NaryAppend(void); NaryAppend(I*i,intn); voidinit(I*i,intn); voidoperator ++(void); }; /* *BinaryAppend * */ template<classI,classJ> inlinevoid Append<I,J>::operator ++(void){ if(i()){ mi=i.min();ma=i.max(); ++i; if(!i()&&j()&&(j.min()==ma+1)){ ma=j.max(); ++j; } }elseif(j()){ mi=j.min();ma=j.max(); ++j; }else{ finish(); } } template<classI,classJ> forceinline Append<I,J>::Append(void){} template<classI,classJ> forceinline Append<I,J>::Append(I&i0,J&j0) :i(i0),j(j0){ if(i()||j()) operator ++(); else finish(); } template<classI,classJ> forceinlinevoid Append<I,J>::init(I&i0,J&j0){ i=i0;j=j0; if(i()||j()) operator++(); else finish(); } /* *NaryAppend * */ template<classI> inlinevoid NaryAppend<I>::operator ++(void){ mi=r[active].min(); ma=r[active].max(); ++r[active]; while(!r[active]()){ //Skipemptyiterators: do{ active++; if(active>=n){ finish();return; } }while(!r[active]()); if(r[active].min()==ma+1){ ma=r[active].max(); ++r[active]; }else{ return; } } } template<classI> forceinline NaryAppend<I>::NaryAppend(void){} template<classI> inline NaryAppend<I>::NaryAppend(I*r0,intn0) :r(r0),n(n0),active(0){ while(active<n&&!r[active]()) active++; if(active<n){ operator ++(); }else{ finish(); } } template<classI> inlinevoid NaryAppend<I>::init(I*r0,intn0){ r=r0;n=n0;active=0; while(active<n&&!r[active]()) active++; if(active<n){ operator++(); }else{ finish(); } } }}} //STATISTICS:iter-any