文章目錄

• • 1 StaticArray設(shè)計(jì)要點(diǎn)
  • 2 繼承關(guān)系圖和接口實(shí)現(xiàn)
  • 3 代碼實(shí)現(xiàn)

1 StaticArray設(shè)計(jì)要點(diǎn)

類模板

• 封裝原生數(shù)組
• 使用模板參數(shù)決定數(shù)組大小
• 實(shí)現(xiàn)函數(shù)返回?cái)?shù)組長(zhǎng)度
• 拷貝構(gòu)造和賦值操作

---

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

繼承關(guān)系圖

接口實(shí)現(xiàn)

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 代碼實(shí)現(xiàn)

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; }

---

參考資料：

數(shù)據(jù)結(jié)構(gòu)實(shí)戰(zhàn)開(kāi)發(fā)教程

總結(jié)

以上是生活随笔為你收集整理的StaicArray的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。