No! you have to create a dynamic array class. ..you must always store old values, delete the previous array and use piInt = new int[11] ..and then replace first 10 indives with old data and add 11th element. ...or just use CArray template (CArray). ...or STL''s list, vector or something ... you''ll find more in MSDN.

Dave007
dave007@volny.cz

Unfortunately, you can''t do that by just using new and delete. There are a few other ways of doing it, though - you could use std::vector. Or use malloc/realloc/free instead of new/delete.

or the really simple answer is....

  // create an array.int *pInt = new int[10];  

fill the array and do whatever.

ok, now we want to resize the array.

  // create a new array.int *pTemp = new int[20];// copy the old array elements to the new array.memcpy(pTemp, pInt, (10 * sizeof(int));// free the old array.free(pInt);// assign the variable to the new pointer address.pInt = pTemp;  

that''s all you gotta do.

To the vast majority of mankind, nothing is more agreeable than to escape the need for mental exertion... To most people, nothing is more troublesome than the effort of thinking.

sorry, "free" should be "delete". i don''t use "new" and "delete" on pointers so, sorry for my mistake.

To the vast majority of mankind, nothing is more agreeable than to escape the need for mental exertion... To most people, nothing is more troublesome than the effort of thinking.

There is also a function provided with the stand c runtime library called realloc( ).

This function can be nasty if you run out of a free memory block large enough to hold the new size, and will have to consitently check for that problem to avoid access violations.

Your other options would be to use vectors (stl has a nice class for these - so I understand, I personally do not use stl), or you could create a linked list and store the information as needed in there.

Now, if you are going to be dealing only with a few bytes of information, esecially in something as simple as a char array, my suggestion would be to use realloc( ), or use a vector. If, however, you intend to be using 2 dimensional arrays, or data structures, I would STRONGLY recommend that you use a linked list.

With a linked list you do not have to worry about finding a block of free memory equal in size to the sum of the objects, but instead will only need a block of memory free and large enough to support each object individually, as one object will tell you where in the memory you can find the next, and vice-versa if you so decide.

Gamedev''s AI Auto-Reply bot.