dynamic-queue.hpp /usr/include/gecode/support.hh Gecode::Support::DynamicQueue Gecode Gecode::Support /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2009 * *Lastmodified: *$Date:2009-09-0821:10:29+0200(Tue,08Sep2009)$by$Author:schulte$ *$Revision:9692$ * *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{namespaceSupport{ template<classT,classA> classDynamicQueue{ private: A&a; intlimit; intfst; intlst; T*q; voidresize(void); voidmove(int&i); public: DynamicQueue(A&a); ~DynamicQueue(void); boolempty(void)const; voidreset(void); Tpop(void); voidpush(constT&x); private: staticvoid*operatornew(size_ts)throw(){(void)s;returnNULL;} staticvoidoperatordelete(void*p){(void)p;}; DynamicQueue(constDynamicQueue&s):a(s.a){} constDynamicQueue&operator=(constDynamicQueue&){return*this;} }; template<classT,classA> forceinlinevoid DynamicQueue<T,A>::move(int&i){ i=(i+1)&(limit-1); } template<classT,classA> void DynamicQueue<T,A>::resize(void){ assert(fst==lst); T*nq=a.templatealloc<T>(limit<<1); intj=0; for(inti=fst;i<limit;i++) nq[j++]=q[i]; for(inti=0;i<lst;i++) nq[j++]=q[i]; a.templatefree<T>(q,limit); q=nq; fst=0; lst=limit; limit<<=1; } template<classT,classA> forceinline DynamicQueue<T,A>::DynamicQueue(A&a0) :a(a0),limit(8),fst(0),lst(0),q(a.templatealloc<T>(limit)){} template<classT,classA> forceinline DynamicQueue<T,A>::~DynamicQueue(void){ a.free(q,limit); } template<classT,classA> forceinlinebool DynamicQueue<T,A>::empty(void)const{ returnfst==lst; } template<classT,classA> forceinlinevoid DynamicQueue<T,A>::reset(void){ fst=lst=0; } template<classT,classA> forceinlineT DynamicQueue<T,A>::pop(void){ assert(!empty()); Tt=q[fst]; move(fst); returnt; } template<classT,classA> forceinlinevoid DynamicQueue<T,A>::push(constT&x){ q[lst]=x; move(lst); if(fst==lst) resize(); } }} //STATISTICS:support-any