1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
| #include <cassert> #include <iostream> #include <stdexcept> using namespace std;
#define size_a 10 #define size_b 20 #define add_size 10
template <class T> class Array { private: T *list; int size; public: Array(int sz = 50); Array(const Array<T> &a); ~Array(); Array<T> &operator = (const Array<T> &rhs); T &operator [] (int i); const T &operator [] (int i) const; operator T *(); operator const T *() const; int getSize() const; void resize(int sz); };
template <class T> Array<T>::Array(int sz) { assert(sz >= 0); size = sz; list = new T[size]; }
template <class T> Array<T>::~Array() { delete[] list; }
template <class T> Array<T>::Array(const Array<T> &a) { size = a.size; list = new T[size]; for (int i = 0; i < size; i++) list[i] = a.list[i]; }
template <class T> Array<T> &Array<T>::operator = (const Array<T> &rhs) { if (&rhs != this) { if (size != rhs.size) { delete[] list; size = rhs.size; list = new T[size]; } for (int i = 0; i < size; i++) list[i] = rhs.list[i]; } return *this; }
template <class T> T &Array<T>::operator [] (int i) throw(out_of_range) { if (i >= size) throw out_of_range("Exception:out of range!"); return list[i]; } template <class T> const T &Array<T>::operator [] (int i) const throw(out_of_range) { if (i >= size) throw out_of_range("Exception:out of range!"); return list[i]; }
template <class T> Array<T>::operator T *() { return list; }
template <class T> Array<T>::operator const T *() const { return list; }
template <class T> int Array<T>::getSize() const { return size; }
template <class T> void Array<T>::resize(int sz) { assert(sz >= 0); if (sz == size) return; T *newList = new T[sz]; int n = (sz < size) ? sz : size; for (int i = 0; i < n; i++) newList[i] = list[i]; delete[] list; list = newList; size = sz; }
int main() { Array<int> a(size_a); Array<int> b(size_b);
cout << "数组a的大小为:" << a.getSize() << endl; cout << "数组b的大小为:" << b.getSize() << endl;
try { for (int i = 0; i < size_a; ++i) a[i] = i + 1;
b = a; cout << "数组b的大小为:" << b.getSize() << endl; cout << "数组b的内容为:"; for (int i = 0; i < b.getSize(); ++i) cout << b[i] << ' '; cout << endl;
b.resize(b.getSize() + add_size); cout << "扩展数组b的容量后,其大小为:" << b.getSize() << endl;
cout << b[b.getSize()] << endl; } catch (out_of_range &e) { cout << e.what() << endl; } return 0; }
|