inline void Remove(int in_index) {for (int i=in_index; i < m_count-1; i++) m_array=m_array[i+1]; m_count--;}
inline void Remove(int in_index)
{
T* newArray=new T[m_arraySize];
// copy members
int newIndex=0;
for (int i=0; i < m_count; i++)
{
if (i != in_index)
newArray[newIndex++]=m_array;
}
// delete old array and replace
delete [] m_array;
m_array=newArray;
}
Quote:Original post by mikeman
I'm not 100% sure, but I think that in the same situation std::vector explicitly calls the destructor of the last element. Of course, that does not free the memory or resizes the buffer at all, so(again, I *think*) when inserting a new element it uses placement new kinda like this(when it doesn't need to allocate a bigger chunck of memory of course):
void push_back(const T& element)
{
T* ptr=&m_array[m_count-1];
new(ptr)T(element)
}
Again, I'm not 100% sure about all of this. Maybe someone else can verify or correct me.
Quote:Original post by RaeldorQuote:Original post by mikeman
I'm not 100% sure, but I think that in the same situation std::vector explicitly calls the destructor of the last element. Of course, that does not free the memory or resizes the buffer at all, so(again, I *think*) when inserting a new element it uses placement new kinda like this(when it doesn't need to allocate a bigger chunck of memory of course):
void push_back(const T& element)
{
T* ptr=&m_array[m_count-1];
new(ptr)T(element)
}
Again, I'm not 100% sure about all of this. Maybe someone else can verify or correct me.
What is...
new(ptr)T(element)
? This form of C++ code is not familiar to me. What does this do?
Also in regards to other questions, the reason I am re-writing is for a learning exercise.
Thanks!
Rael
Quote:Original post by Raeldor
What is...
new(ptr)T(element)
?
// Typesafe - leaves back objects 'alive' - will be okay on delete[]// and uses assignment operatorvoid SomeArrayClass::Remove(int nIndex,int nCount) throw(){ if (nIndex < m_Count) { const int nCheck = nIndex + nCount; if (nCheck >= m_Count) { m_Count = nIndex; } else { for (int x = nIndex,y = nCheck; y < m_Count; ++x,++y) { m_ArrayData[x] = m_ArrayData[y]; } m_Count -= nCount; } }}
