dynamic-array.hpp algorithm /usr/include/gecode/support.hh Gecode::Support::DynamicArray Gecode Gecode::Support /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2002 * *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. * */ #include<algorithm> namespaceGecode{namespaceSupport{ template<classT,classA> classDynamicArray{ private: A&a; intn; T*x; voidresize(intn); public: DynamicArray(A&a0,intn=32); DynamicArray(constDynamicArray<T,A>&da); ~DynamicArray(void); constDynamicArray<T,A>&operator =(constDynamicArray<T,A>&da); T&operator [](inti); constT&operator [](int)const; operatorT*(void); }; template<classT,classA> forceinline DynamicArray<T,A>::DynamicArray(A&a0,intn0) :a(a0),n(n0),x(a.templatealloc<T>(n)){} template<classT,classA> forceinline DynamicArray<T,A>::DynamicArray(constDynamicArray<T,A>&da) :a(da.a),n(da.n),x(a.templatealloc<T>(n)){ (void)heap.copy<T>(x,da.x,n); } template<classT,classA> forceinline DynamicArray<T,A>::~DynamicArray(void){ a.free(x,n); } template<classT,classA> forceinlineconstDynamicArray<T,A>& DynamicArray<T,A>::operator =(constDynamicArray<T,A>&da){ if(this!=&da){ if(n<da.n){ a.free(x,n);n=da.n;x=a.templatealloc<T>(n); } (void)heap.copy(x,da.x,n); } return*this; } template<classT,classA> void DynamicArray<T,A>::resize(inti){ intm=std::max(i+1,(3*n)/2); x=a.realloc(x,n,m); n=m; } template<classT,classA> forceinlineT& DynamicArray<T,A>::operator [](inti){ if(i>=n)resize(i); assert(n>i); returnx[i]; } template<classT,classA> forceinlineconstT& DynamicArray<T,A>::operator [](inti)const{ assert(n>i); returnx[i]; } template<classT,classA> forceinline DynamicArray<T,A>::operatorT*(void){ returnx; } }} //STATISTICS:support-any