实现自己的vector（简单模版）

#pragma once
template<class T>
class CMyVector{
private:
    int m_nLenth;//长度
    int m_nCount;//元素个数
    T*  m_pVec;//指针
public:
    CMyVector(int nCount = 0, T tValue = 0){
        m_nCount = nCount;
        m_nLenth = nCount;
        if (nCount){
            m_pVec = new T[nCount];
            if (!m_pVec)
                return;
            for (UINT i = 0; i < nCount; i++){
                m_pVec[i] = tValue;
            }
        }
    }
    ~CMyVector();
    bool IsEmpty(){
        return !m_nCount;
    }
    bool IsFull(int nInsertCount = 1){
        return m_nCount + nInsertCount > m_nLenth;
    }
    bool Push_back(T tValue){
        if (IsFull()){
            Resize();
        }
        m_pVec[m_nCount++] = tValue;
    }
    bool Resize(int nNum = 0){
        m_nLenth += nNum;
        if (nNum){
            m_nLenth += nNum;
        }
        else{
            m_nLenth = m_nLenth * 2 + 1;
        }
        T* p = new T[m_nLenth];
        if (!p){
            //失败
        }

        ZeroMemory(p, sizeof(T)*m_nLenth);
        memcpy_s(p, sizeof(T)*m_nCount, m_pVec, 
            sizeof(T)*m_nCount);
        delete[] m_pVec;
        m_pVec = p;
    }
    bool Pop_back(T &tValue){
        if (IsEmpty()){
            return false;
        }
        m_nCount--;
        tValue = m_pVec[m_nCount];//可修改返回值
        return true;
    }
    T operator[](int nIndex){
        if (nIndex > m_nCount - 1){
            //error
            return 0;
        }
        return m_pVec[nIndex];
    }
    bool Insert(int nPos, int nCount, T elem){
        if (nPos > m_nCount){
        
        }
        if(IsFull(nCount)){
            Resize();
        }
        for (UINT i = 0; i < m_nCount - nPos + 1; i++){
            m_pVec[nCount + m_nCount - 1 - i] = m_pVec[m_nCount - 1 - i];
        }
        for (UINT i = 0; i < nCount; i++){
            m_pVec[nPos + i] = elem;
        }
    }
    bool Insert(int nPos, T* begin, T* end){
        int nCount = (end - begin) / sizeof(T)+1;
        if (nPos > m_nCount){

        }
        if (IsFull(nCount)){
            Resize();
        }
        for (UINT i = 0; i < m_nCount - nPos + 1; i++){
            m_pVec[m_nCount + nPos - 1 - i] = m_pVec[m_nCount - 1 - i];
        }
        for (UINT i = 0; i < nCount; i++){
            m_pVec[nPos + i] = *begin;
            begin++;
        }
    }
    T& At(int nIndex){
        if (nIndex > m_nCount - 1){
            //error
        }
        return m_pVec[nIndex];//可修改值
    }
};