模板类的继承数组类.doc

#include #include #include #include #include #include using namespace std;template class Arraypublic:/ explicit Array( int size = DefaultArraySize );Array( elemType *array, int array_size );Array( const Array &rhs );virtual Array() delete ia; / bool operator=( const Array& ) const;bool operator!=( const Array& ) const;Array& operator=( const Array& );int size() const return _size; / . . .virtual elemType& operator(int index) return iaindex; virtual void sort();virtual elemType min() ;virtual elemType max() ;virtual int find( const elemType &value ) ;virtual void sort_small_to_big();virtual void sort_big_to_small();void Traversing_arrays()const;protected:/ 13.5 static int DefaultArraySize;void init( int sz, elemType *array );int _size;elemType *ia;template int Array:DefaultArraySize = 12;template void Array:init( int sz, elemType *array )if(sz = 0 )_size = DefaultArraySize;else_size = sz;ia = new elemType _size ;for ( int ix=0; ix _size; +ix )if ( ! array )ia ix = 0;else ia ix = array ix ;template Array:Array( int size )init( size, 0 );template Array:Array( elemType *array, int array_size )init( array_size, array );template Array:Array( const Array &rhs )init( rhs._size, rhs.ia);template void Array:sort_small_to_big()int temp;int i,j;for(j=0;j_size-1;j+)for (i=0;iiai+1)temp=iai;iai=iai+1;iai+1=temp;template void Array:sort_big_to_small()int temp;int i,j;for(j=0;j_size-1;j+)for (i=0;i_size-j-1;i+)if (iaiiai+1)temp=iai;iai=iai+1;iai+1=temp;template elemType Array:min()sort_small_to_big();return ia0;template elemType Array:max()sort_small_to_big();return ia_size-1;template int Array:find(const elemType &value)sort_small_to_big();int high=_size-1,low=0,mid;mid=(high+low)/2;while(high=low)if(valueiamid)low=mid+1;else if(valueiamid)high=mid-1;else return mid;mid=(high+low)/2;return -1;template bool Array:operator = (const Array& arr)constint i;for(i=0;iiai)return 0;return 1;template bool Array:operator != (const Array& arr)constint i;for(i=0;iiai)return 1;return 0;template Array& Array:operator = (const Array& arr)int i;for(i=0;iiai = arr.iai;return *this;template void Array:Traversing_arrays()constint i;for(i=0;i_size;i+)coutiaiendl;template class ArrayRC : public Arraypublic:ArrayRC( int array_size = Array:DefaultArraySize ): Array( array_size )ArrayRC( elemType *array, int array_size ): Array( array, array_size )ArrayRC( const ArrayRC &rhs ): Array( rhs ) virtual elemType&operator( int index );private:void check_range( int );template inline elemType& ArrayRC:operator( int index )check_range( index );return Array:ia index ;template inline void ArrayRC:check_range( int index )assert( index = 0 & index Array:_size );#if 1int main()const int array_size = 4;/ elemType intArray ia(array_size);/ elemType doubleArray da(array_size);/ elemType charArray ca(array_size);/Array str(array_size);int ix;for ( ix = 0; ix array_size; +ix )iaix = ix;daix = ix * 1.75;caix = ix + a;/strix