Deleting and resizing a pointer array.

I have a game, and i would like to be able to resize the array of enemies for every level, right now the array is just set to a static 100, but that only allows 25 levels. I'm not looking for more level's, rather, more dynamic memory usage.

something like; (note: this causes a segmentation error on my compiler)

Code:

---

Enemy enemyArray[NumberOfEnemies];
.....
//New Level

NumberOfEnemies+=2;
delete [] enemyArray;
Enemy enemyArray[NumberOfEnemies];
.....
//ect...

---

use a vector

you cannot deallocate something you allocated on the stack, hence the segfault.

Code:

---

Enemy enemyArray[NumberOfEnemies];
...
delete [] enemyArray;

---

is not allowed.

There is no easy way to do it with new/delete. You have two options, use a std::vector, or malloc/realloc/dealloc. The latter is not recommended in C++ (but will work), since it's from C.

there is a third option:

Code:

---

template <class T> T* arrayResize(T arr[],const unsigned int oldSize,const unsigned int newSize, T defaultVal)
{
        T *temp = new T[newSize];
        unsigned int i;
        if(oldSize<newSize)
        {
                i=oldSize;
        }
        else
        {
                i=newSize;
        }
        while(i)
        {
                --i;
                temp[i]=arr[i];
        }
        delete[] arr;
        i=oldSize;
        while(i<newSize)
        {
                temp[i]=defaultVal;
                ++i;
        }
        arr = temp;
        return arr;
}

---

Quote:

---

Originally Posted by cyberfish

There is no easy way to do it with new/delete. You have two options, use a std::vector, or malloc/realloc/dealloc. The latter is not recommended in C++ (but will work), since it's from C.

---

Only if you're using PODs.
If you're allocating objects, you have to use new/delete, otherwise the constructors/destructors won't be called.

vectors & strings are your friends. Use them as much as possible to make your life a lot easier.

you have basically reinvented a harder to use and less efficient version of std::vector.

Quote:

---

there is a third option:

---

However, it does illustrate why using a vector as you suggested would be better - the temporary array is default initialised, but it would be better to defer the initialisation, say with placement new, but this would then complicate the use of the dynamically allocated array. Also, oldSize and newSize should be of type size_t, with the const qualifier not useful in this case. defaultVal should probably be passed by const reference.

Incidentally, I would think that for loops are more appropriate here :)

thanks. illustrative as always.

i read that article you linked about using placement new. it seemed simple enough, but IIRC the char buffers had to be freed/deleted explicitly in addition to deleting the object that was allocated on that memory space. so in a resizing function such as this, rather than a container class, it didn't seem practical to track all the char buffers that were allocated.

yes, i realize this is more an argument for the use of container classes (namely vector) than anything :)

if i've grossly misconstrued something here, please let me know...

just looked into it and in my compiler size_t is identical to unsigned int :)

Quote:

---

Originally Posted by m37h0d

just looked into it and in my compiler size_t is identical to unsigned int :)

---

But you will probably also find:
1. Some other architectures have a size_t that is not the same size as int. [1]
2. size_t is a unsigned value, int is signed.


[1] Generally, size_t is the same size as a pointer - not ALWAYS, but most of the time.
--
Mats