bool OrderTab<T>::insertElemt(int i,T e){  //连续插入的

if (i<0 || i>m_iLength || m_iLength==m_iSize) //超出容量就不再插入，应该判断  m_iSize==m_iLength

return false;

for (int j = m_iLength - 1; j >= i; j--)

m_pList[j + 1] = m_pList[j];

m_pList[i] = e;

m_iLength++;

return true;

}