C++fanxing.rar_fanxing_visual c

#include <iostream> #include <string> using namespace std; //Class Template template <class T=int, int sz=300> class Array { public: Array() { _size=sz; _ia=new T[_size]; // int i; // for (i=0;i<_size;i++) // _ia[i]=_size-i; } ~Array() { delete[] _ia; } // /* Array(const Array& rhs)//Copy Constructor { _size=rhs.size(); _ia=new T[_size]; int i; for (i=0;i<_size;i++) _ia[i]=rhs.find(i); } // */ // /* Array& operator=(const Array& rhs) { if (this!=&rhs) { _size=rhs.size(); _ia=new T[_size]; int i; for (i=0;i<_size;i++) _ia[i]=rhs.find(i); } return *this; } // */ ///* bool operator==(const Array& rhs) const { if (_size==rhs.size()) { int i; for (i=0;i<_size;i++) if (_ia[i]!=rhs.find(i)) return false; return true; } else return false; } bool operator!=(const Array& rhs) const { if (_size==rhs.size()) { int i; for (i=0;i<_size;i++) if (_ia[i]!=rhs.find(i)) return true; return false; } else return true; } #if 0 //const T operator[](int i) const { return _ia[i]; } #else //non-const T& operator[](int i) { return _ia[i]; } #endif // */ int size() const {return _size;} T min() const//; { int i; T j=_ia[0]; for (i=1;i<_size;i++) if (j>_ia[i]) j=_ia[i]; return j; } T max() const//; { int i; T j=_ia[0]; for (i=1;i<_size;i++) if (j<_ia[i]) j=_ia[i]; return j; } T find(int value) const//; { if (value>(_size-1)) return 0;//-1; return _ia[value]; } private: T *_ia; int _size; }; ////////////////////////////////////////// class Record { public: Record(int sz=2) { _size=sz; switch (_size) { case 1: _ia=new string("1A"); break; case 2: _ia=new string("2B"); break; case 3: _ia=new string("3C"); break; default: _ia=new string("NO"); } } ~Record() { delete _ia; } private: string *_ia; int _size; }; ////////////////////////////////////////// int main() { Array<> v0; Array<int> v1; Array<int*> pv1; Array<double, 100> v2; Array<float, 10> v3; Array<string, 5> v4; Array<string, 4> v5; Array<string, 4> v7; Record v8; Record v9[3]; Array<Record, 4> v10; int i; string s; for (i=0;i<v0.size();i++) v0[i]=v0.size()-i; cout<<"v0 size="<<v0.size()<<endl; cout<<"v0 max="<<v0.max()<<endl; cout<<"v0 min="<<v0.min()<<endl; cout<<"v1 size="<<v1.size()<<endl; cout<<"v1 max="<<v1.max()<<endl; cout<<"v1 min="<<v1.min()<<endl; for (i=0;i<v2.size();i++) v2[i]=v2.size()-i; cout<<"v2 size="<<v2.size()<<endl; cout<<"v2 max="<<v2.max()<<endl; cout<<"v2 min="<<v2.min()<<endl; for (i=0;i<v3.size();i++) v3[i]=v3.size()-i; cout<<"v3 size="<<v3.size()<<endl; cout<<"v3 max="<<v3.max()<<endl; cout<<"v3 min="<<v3.min()<<endl; for (i=0;i<v4.size();i++) v4[i]=0x41+i; for (i=0;i<v4.size();i++) { s=v4[i]; cout<<"v4:"<<s<<endl; } v5[0]="Pety"; v5[1]="Edward"; v5[2]="Sweetday"; v5[3]="Kerk"; for (i=0;i<v5.size();i++) { //s=v5[i]; cout<<"v5:"<<v5[i]<<endl;//s<<endl; } cout<<"v4[3]:"<<v4.find(3)<<endl; Array<string, 5> v6=v4;//Length must be the same, else compiler error for (i=0;i<v6.size();i++) { s=v6[i]; cout<<"v6:"<<s<<endl; } // /* v7=v5;//Length must be the same, else compiler error cout<<"v7=v5"<<endl; for (i=0;i<v7.size();i++) { s=v7[i]; cout<<"v7:"<<s<<endl; } // */ return 0; }