CArray

#include <iostream>
using namespace std;
#include <memory.h>
template <class TYPE,class REF_TYPE>
class CArray  
{
private:
int m_Size;
int m_Count;
TYPE *m_Data;
public:
int GetSize() const
{
return m_Size;
}
void RemoveAll()
{
m_Size=0;
}
TYPE GetAt( int nIndex ) const
{
return m_Data[nIndex];
}
void SetAt( int nIndex,TYPE newData)
{
m_Data[nIndex]=newData;
}
TYPE& ElementAt( int nIndex )
{
return m_Data[nIndex];
}
const TYPE* GetData( ) const
{
return m_Data;
}
TYPE* GetData( )
{
return m_Data;
}
TYPE& operator []( int nIndex )
{
return m_Data[nIndex];
}

TYPE operator []( int nIndex ) const
{
return m_Data[nIndex];
}

CArray()
{

m_Size=0;
m_Count=4;
m_Data = (TYPE *)calloc( m_Count, sizeof( TYPE ) );

}
~CArray()
{
delete []m_Data;
}
int Add(REF_TYPE newData )
{
if(m_Size>=m_Count)
SetSize(m_Size);
m_Data[m_Size]=newData;
++m_Size;
return m_Size;

}
void SetSize( int newSize)
{
if(m_Size==0)
{
m_Data=(TYPE*)calloc(newSize,sizeof(TYPE));
m_Count=newSize;
}
else
{
m_Count=newSize*2;
TYPE* pNew =(TYPE*)calloc(m_Count,sizeof(TYPE));
memcpy(pNew,m_Data,sizeof(TYPE)*m_Size);
delete []m_Data;
m_Data=pNew;
}
}
void InsertAt( int nIndex, REF_TYPE newData, int nCount = 1 )
{
if(nIndex<0||nCount<0)
return ;
int flag;//标识
int bak=nIndex;
if((nIndex>m_Size)) //要插入的索引它大于了数据的个数 数据的总数就是nIndex+nCount
{
flag=0;
if((nIndex+nCount)>m_Count)
SetSize(nIndex+m_Size);

}
else if(nIndex<=m_Size) //要插入的索引它小于等于数据的个数 数据的总数就是 nIndex+m_Size
{
flag=1;
if((nIndex+m_Size)>m_Count)
SetSize(nIndex+nCount);
memcpy(m_Data+nIndex+nCount,m_Data+nIndex,sizeof(TYPE)*(m_Size-nIndex));

}
for(int i=0;i<nCount;i++,bak++)
{
m_Data[bak]=newData;

}
if(flag==1)
m_Size+=nCount;
else
m_Size=nIndex+nCount;
}
void RemoveAt( int nIndex, int nCount = 1 )
{
if(nIndex<0 ||nCount<0)
return;
else if((nIndex+nCount)>m_Size) //大于m_Size说明了nIndex后面的都不要了
{
if(nIndex>=m_Size)//删除位大于m_Size直接返回
return ;
else
m_Size=nIndex;
return ;
}

else if((nIndex+nCount)==m_Size)//删除位+删除量==m_Size说明要删除最后一个
m_Size-=nCount;
else//正常情况也包括删除头
{
memcpy(m_Data+nIndex,m_Data+nIndex+nCount,sizeof(TYPE)*(m_Size-nIndex-nCount));
m_Size-=nCount;
}
}