• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            一,利用模板來定制N維網格,這在開發一些與棋類有關的游戲等時幫助很大,因為是可擴展的,而且可以重用。以下摘抄其主要的代碼片斷。
            #ifndef NDGRID_H
            #define NDGRID_H

            template <typename T, int N>
            class NDGrid
            {
            public:
            ?NDGrid();
            ?NDGrid(int inSize);
            ?NDGrid(const NDGrid<T,N>& src);
            ?~NDGrid();

            ?NDGrid<T,N>& operator=(const NDGrid<T,N>& rhs);
            ?void resize(int newSize);
            ?NDGrid<T,N-1>& operator[](int x);
            ?const NDGrid<T,N-1>& operator[](int x) const;
            ?int getSize() const {return mSize; }
            ?static const int kDefaultSize = 10;
            protected:
            ?void copyFrom(const NDGrid<T,N>& src);
            ?NDGrid<T,N-1>* mElems;
            ?int mSize;
            };

            template <typename T>
            class NDGrid<T,1>
            {
            public:
            ?NDGrid(int inSize = kDefaultSize);
            ?NDGrid(const NDGrid<T,1>& src);
            ?~NDGrid();
            ?NDGrid<T,1>& operator=(const NDGrid<T,1>& rhs);
            ?void resize(int newSize);
            ?T& operator[](int x);
            ?const T& operator[](int x) const;
            ?int getSize() const { return mSize; }
            ?static const int kDefaultSize = 10;
            protected:
            ?void copyFrom(const NDGrid<T,1>& src);
            ?T* mElems;
            ?int mSize;
            };

            #endif


            #include "NDGrid.h"

            template <typename T,int N>
            const int NDGrid<T,N>::kDefaultSize;

            template <typename T,int N>
            NDGrid<T,N>::NDGrid(int inSize) : mSize(inSize)
            {
            ?mElems = new NDGrid<T,N-1>[mSize];
            ?for(int i = 0; i < mSize; i++){
            ??mElems[i].resize(inSize);
            ?}
            }

            template <typename T, int N>
            NDGrid<T,N>::NDGrid() : mSize(kDefaultSize)
            {
            ?mElems = new NDGrid<T,N-1>[mSize];
            }

            template <typename T, int N>
            NDGrid<T,N>::NDGrid(const NDGrid<T,N>& src)
            {
            ?copyFrom(src);
            }

            template <typename T, int N>
            NDGrid<T,N>::~NDGrid()
            {
            ?delete [] mElems;
            }

            template <typename T,int N>
            void NDGrid<T,N>::copyFrom(const NDGrid<T,N>& src)
            {
            ?mSize = src.mSize;
            ?mElems = new NDGrid<T,N-1>[mSize];
            ?for(int i = 0; i < mSize; i++){
            ??mElems[i] = src.mElems[i];
            ?}
            }

            template <typename T,int N>
            NDGrid<T,N>& NDGrid<T,N>::operator =(const NDGrid<T,N>& rhs)
            {
            ?//check for self-assignment
            ?if(this == &rhs){
            ??return (*this);
            ?}
            ?//free the old memory
            ?delete [] mElems;
            ?//copy the new memory
            ?copyFrom(rhs);
            ?return (*this);
            }

            template <typename T,int N>
            void NDGrid<T,N>::resize(int newSize)
            {
            ?//////allocate the new array iwth the new size
            ?NDGrid<T,N-1>* newElems = new NDGrid<T,N-1>[newSize];
            ?//copy all the elements, handling the cases where new Size
            ?//is larger than mSize nd smaller than msize.
            ?for(int i = 0; i < newSize && i < mSize; i++){
            ??newElems[i] = mElems[i];
            ??//resize the nested Grid elems recursively.
            ??newElems[i].resize(newSize);
            ?}
            ?//store the new size and pointer to the new array.
            ?//free the memory for the old array first.
            ?mSize = newSize;
            ?delete [] mElems;
            ?mElems = newElems;
            }

            template <typename T,int N>
            NDGrid<T,N-1>& NDGrid<T,N>::operator [](int x)
            {
            ?return (mElems[x]);
            }

            template <typename T,int N>
            const NDGrid<T,N-1>& NDGrid<T,N>::operator [](int x) const
            {
            ?return (mElems[x]);
            }

            //////specialization? implementation

            template <typename T>
            const int NDGrid<T,1>::kDefaultSize;

            template <typename T>
            NDGrid<T,1>::NDGrid(int inSize) : mSize(inSize)
            {
            ?mElems = new T[mSize];
            }

            template < typename T>
            NDGrid<T,1>::NDGrid(const NDGrid<T,1>& src)
            {
            ?copyFrom(src);
            }

            template <typename T>
            NDGrid<T,1>::~NDGrid()
            {
            ?delete [] mElems;
            }

            template <typename T>
            void NDGrid<T,1>::copyFrom(const NDGrid<T,1>& src)
            {
            ?mSize = src.mSize;
            ?mElems = new T[mSize];
            ?for(int i = 0; i < mSize; i++){
            ??mElems[i] = src.mElems[i];
            ?}
            }

            template < typename T>
            NDGrid<T,1> & NDGrid<T,1>::operator =(const NDGrid<T,1>& rhs)
            {
            ?//check for self-assignment
            ?if(this == & rhs){
            ??return(*this);
            ?}
            ?delete [] mElems;
            ?copyFrom(rhs);
            ?return (*this);
            }

            template <typename T>
            void NDGrid<T,1>::resize(int newSize)
            {
            ?T* newElems = new T[newSize];

            ?for(int i =0; i < newSize && i < mSize; i++){
            ??newElems[i] = mElems[i];
            ??///don't need to resize recursively,because this is the base case.
            ?}
            ?mSize = newSize;
            ?delete [] mElems;
            ?mElems = newElems;
            }

            template <typename T>
            T& NDGrid<T,1>::operator [](int x)
            {
            ?return (mElems[x]);
            }

            template <typename T>
            const T& NDGrid<T,1>::operator [](int x) const
            {
            ?return (mElems[x]);
            }



            #include <iostream>
            using namespace std;
            #include "NDGrid.h"

            int main()
            {
            ?NDGrid<int,3> my3DGrid;
            ?my3DGrid[2][1][2] = 5;
            ?my3DGrid[1][1][1] = 5;

            ?NDGrid<float,2> my2DGrid;
            ?my2DGrid[5][2] = 3;
            ?my2DGrid[2][5] = 2;

            ?cout << my3DGrid[2][1][2] << endl;

            ?cout<<my2DGrid[5][2]<<endl;

            ?return 0;
            }

            posts - 15, comments - 2, trackbacks - 0, articles - 29

            Copyright © 美洲豹

            久久国产精品二国产精品| 久久久久女人精品毛片| 国产精品99久久99久久久| 欧美亚洲国产精品久久蜜芽| 欧美丰满熟妇BBB久久久| 久久久久久综合网天天| 久久九九久精品国产免费直播| 四虎久久影院| 久久亚洲AV无码精品色午夜麻豆| 欧美久久一级内射wwwwww.| 亚洲&#228;v永久无码精品天堂久久 | 午夜精品久久久久久| 久久这里只有精品视频99| 无码任你躁久久久久久老妇| 中文字幕久久久久人妻| 99久久er这里只有精品18| 亚洲av成人无码久久精品| 热re99久久6国产精品免费| 久久精品国产秦先生| 精品久久综合1区2区3区激情| 久久亚洲电影| 色综合久久久久久久久五月| 国产精品久久久久久久| 91性高湖久久久久| 一本久久综合亚洲鲁鲁五月天| 亚洲中文字幕无码久久2017| 国产∨亚洲V天堂无码久久久| 国内精品久久久久久麻豆| 99精品久久精品一区二区| 国产精品岛国久久久久| 亚洲人成网站999久久久综合| 久久精品国产亚洲av日韩| 国产精品女同一区二区久久| 久久国产亚洲精品| 亚洲综合婷婷久久| 2020久久精品亚洲热综合一本| 精品久久久久久久久午夜福利| 久久国产高清字幕中文| 久久精品人妻中文系列| 久久精品国产国产精品四凭| 久久久噜噜噜久久中文福利|