文章目錄

• • 1 StaticArray設計要點
  • 2 繼承關系圖和接口實現
  • 3 代碼實現

1 StaticArray設計要點

類模板

• 封裝原生數組
• 使用模板參數決定數組大小
• 實現函數返回數組長度
• 拷貝構造和賦值操作

---

2 繼承關系圖和接口實現

繼承關系圖

接口實現

template < typename T, int N > class StaticArray : public Array<T> { protected:T m_space[N];public:StaticArray();// 拷貝和賦值操作StaticArray(const StaticArray<T, N>& obj);StaticArray<T, N>& operator= (const StaticArray<T, N>& obj);int length() const; };

---

3 代碼實現

StaticArray.h

#ifndef STATICARRAY_H #define STATICARRAY_H#include "Array.h"namespace LemonLib { template < typename T, int N > class StaticArray : public Array<T> { protected:T m_space[N];public:StaticArray(){this->m_array = m_space;}// 拷貝和賦值操作StaticArray(const StaticArray<T, N>& obj){this->m_array = m_space;for (int i=0; i<N; i++){m_space[i] = obj.m_space[i];}}StaticArray<T, N>& operator= (const StaticArray<T, N>& obj){if (this != &obj){for (int i=0; i<N; i++){m_space[i] = obj.m_space[i];}}return *this;}int length() const{return N;} }; }#endif // STATICARRAY_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"using namespace std; using namespace LemonLib;int main() {StaticArray<int, 5> sa;for (int i=0; i<sa.length(); i++){sa[i] = i;}for (int i=0; i<sa.length(); i++){cout << sa[i] << endl;}StaticArray<int, 5> sa1 = sa;for (int i=0; i<sa1.length(); i++){cout << sa1[i] << endl;}StaticArray<int, 5> sa2;sa2 = sa;for (int i=0; i<sa2.length(); i++){cout << sa2[i] << endl;}sa[9] = 0;return 0; }

---

參考資料：

數據結構實戰開發教程

總結

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

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