• <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維網(wǎng)格,這在開發(fā)一些與棋類有關(guān)的游戲等時(shí)幫助很大,因?yàn)槭强蓴U(kuò)展的,而且可以重用。以下摘抄其主要的代碼片斷。
            #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 © 美洲豹

            久久这里只有精品久久| 久久免费的精品国产V∧| 狠狠综合久久AV一区二区三区| 久久99精品久久久久久9蜜桃| 99久久99久久精品国产片果冻 | 久久精品成人免费看| 久久久久久a亚洲欧洲aⅴ| 国产成人精品久久二区二区| 精品久久久久久国产牛牛app| 久久久久久久免费视频| 久久精品成人免费看| 一本大道久久香蕉成人网| 99精品国产在热久久无毒不卡| 久久婷婷久久一区二区三区| 久久午夜免费视频| 久久伊人色| 欧美午夜A∨大片久久 | 九九精品久久久久久噜噜| 青青青国产成人久久111网站| 伊人久久大香线蕉亚洲| 亚洲精品国产综合久久一线| 久久精品无码一区二区三区| 久久久久亚洲Av无码专| 精品乱码久久久久久久| 久久人人爽人人爽人人AV东京热| 久久精品国产日本波多野结衣| 欧美色综合久久久久久 | 久久国产成人午夜AV影院| 大伊人青草狠狠久久| 久久精品成人免费网站| 久久影视综合亚洲| 亚洲国产成人久久综合区| 蜜臀av性久久久久蜜臀aⅴ麻豆 | 国内精品久久久久久不卡影院| 久久se精品一区二区影院| 久久久无码精品亚洲日韩蜜臀浪潮| 国产精品久久国产精麻豆99网站| 久久久艹| 精品久久人人妻人人做精品| 亚洲精品国产字幕久久不卡| 久久国产成人亚洲精品影院|