文章目錄

• • 1 DynamicArray設計要點
  • 2 繼承關系圖和接口實現(xiàn)
  • 3 代碼實現(xiàn)
  • 4 代碼優(yōu)化

1 DynamicArray設計要點

類模板

• 動態(tài)確定內部數(shù)組空間的大小
• 實現(xiàn)函數(shù)返回數(shù)組長度
• 構造拷貝和賦值操作

---

2 繼承關系圖和接口實現(xiàn)

繼承關系圖

接口實現(xiàn)

template < typename T > class DynamicArray : public Array<T> { protected:int m_length;public:DynamicArray(int length);DynamicArray(const DynamicArray<T>& obj);DynamicArray<T>& operator= (const DynamicArray<T>& obj);void resize(int length);int length() const;~DynamicArray(); };

---

3 代碼實現(xiàn)

DynamicArray.h

#ifndef DYNAMICARRAY_H #define DYNAMICARRAY_H#include "Array.h" #include "Exception.h"namespace LemonLib { template < typename T > class DynamicArray : public Array<T> { protected:int m_length;public:DynamicArray(int length = 0){this->m_array = new T[length];if (this->m_array){m_length = length;}else{THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to create DynamicArray obj...");}}DynamicArray(const DynamicArray<T>& obj){this->m_array = new T[obj.m_length];if (this->m_array){for (int i=0; i<obj.m_length; i++){this->m_array[i] = obj.m_array[i];}m_length = obj.m_length;}else{THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to copy DynamicArray obj...");}}DynamicArray<T>& operator= (const DynamicArray<T>& obj){if (this != &obj){T* array = new T[obj.m_length];if (array){for (int i=0; i<obj.m_length; i++){array[i] = obj.m_array[i];}T* tmp = this->m_array;this->m_array = array;m_length = obj.m_length;delete[] tmp;}else{THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to copy DynamicArray obj...");}}return *this;}void resize(int length){if (length != m_length){T* array = new T[length];if (array){int len = (m_length < length) ? m_length : length;for (int i=0; i<len; i++){array[i] = this->m_array[i];}T* tmp = this->m_array;this->m_array = array;m_length = length;delete[] tmp;}else{THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to resize DynamicArray obj...");}}}int length() const{return m_length;}~DynamicArray(){delete[] this->m_array;} }; }#endif // DYNAMICARRAY_H

main.cpp

#include <iostream> #include "Object.h" #include "Exception.h" #include "List.h" #include "Seqlist.h" #include "Staticlist.h" #include "Dynamiclist.h" #include "Staticarray.h" #include "DynamicArray.h"using namespace std; using namespace LemonLib;int main() {DynamicArray<int> da(5);for (int i=0; i<da.length(); i++){da[i] = i * i;}for (int i=0; i<da.length(); i++){cout << da[i] << endl;}DynamicArray<int> da1 = da;for (int i=0; i<da1.length(); i++){cout << da[i] << endl;}DynamicArray<int> da2(10);da2 = da1;for (int i=0; i<da2.length(); i++){cout << da2[i] << endl;}da2.resize(10);for (int i=0; i<da2.length(); i++){cout << da2[i] << endl;}da2.resize(3);for (int i=0; i<da2.length(); i++){cout << da2[i] << endl;}return 0; }

---

4 代碼優(yōu)化

可以看出DynamicArray類中函數(shù)實現(xiàn)存在重復的邏輯，如何進行代碼優(yōu)化呢？

重復代碼邏輯的抽象

• init：對象構造時的初始化操作。
• copy：在堆空間中申請新的內存，并執(zhí)行拷貝操作。
• update：將指定的堆空間作為內部存儲數(shù)組使用。

#ifndef DYNAMICARRAY_H #define DYNAMICARRAY_H#include "Array.h" #include "Exception.h"namespace LemonLib { template < typename T > class DynamicArray : public Array<T> { protected:int m_length;T* copy(T* array, int len, int newLen){T* ret = new T[newLen];if (ret != NULL){int size = (len < newLen) ? len : newLen;for (int i=0; i<size; i++){ret[i] = array[i];}}return ret;}void update(T* array, int len){if (array != NULL){T* tmp = this->m_array;this->m_array = array;m_length = len;delete[] tmp;}else{THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to update DynamicArray obj...");}}void init(T* array, int len){if (array != NULL){this->m_array = array;m_length = len;}else{THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to init DynamicArray obj...");}}public:DynamicArray(int length){init(new T[length], length);}DynamicArray(const DynamicArray<T>& obj){init(copy(obj.m_array, obj.m_length, obj.m_length), obj.m_length);}DynamicArray<T>& operator= (const DynamicArray<T>& obj){if (this != &obj){update(copy(obj.m_array, obj.m_length, obj.m_length), obj.m_length);}return *this;}void resize(int length){if (length != m_length){update(copy(this->m_array, m_length, length), length);}}int length() const{return m_length;}~DynamicArray(){delete[] this->m_array;} }; }#endif // DYNAMICARRAY_H

總結

以上是生活随笔為你收集整理的DynamicArray的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。