Dynamic Array Size

This is my first post so im unsure if this has been asked before.

Im trying to write a program that will update the size of an array while running. Say a count is given that will get larger and larger as information is entered, how do I reflect that in the size of the array, without putting in some rediculous number.

Press the little search button and search for dynamic array.

To summarize all of the links you'll find, you dynamicly allocate memory using malloc or calloc . Be sure to free it when you're done.

Quzah.

and you'll need memcpy() to maintain the data in the array as well as memset() to initialize the array.

>as well as memset() to initialize the array
Unless we're talking about an array of anything but integral values. Then you can't be sure that all bits zero represents the equivalent of 0 for that type.

fair enough prelude. picky picky

In C++ we would let the constructor do the work. In C I suppose you'll have some sort of Init function that does the work. memset is just the usual way of setting everything to zero when zero is an acceptable initialization.

>picky picky
That's what I'm known for.

And you could use realloc to give it a chance to run faster.

>And you could use realloc to give it a chance to run faster.
This should be good. And why would using realloc give it a change of running faster?

Originally posted by Prelude
>as well as memset() to initialize the array
Unless we're talking about an array of anything but integral values. Then you can't be sure that all bits zero represents the equivalent of 0 for that type.

In the scenario given, its highly unlikely the array even needs initialising anyway. It would appear that data is going straight into it. You only need to initialise if the array contents is going to be read before real data is stored there.

Originally posted by Prelude
This should be good. And why would using realloc give it a change of running faster? [/B]

Well correct me if I'm wrong, or if didn't understand what minignaz means to do, but what I understood is that he wants to "resize" an array. In this case using malloc/calloc then free and memcpy repeatidly will allocate new memory each time you resize it. Realloc will avoid that if possible, i.e. if memory is available just after the one already allocated, in particular if no memory was granted on the heap between two resizes. At least that's what I thought :-) . Plus it will take care of the memcpy if needed.

>Well correct me if I'm wrong
Well, you're not wrong (for the most part). However, you didn't quite understand quzah's reply. He gave a link to the man pages for calloc, malloc, free, and realloc. Presumably the OP would read the page thoroughly and realize that realloc is the correct function to use, thus saving us the effort of explaining the gory details.

I think I skipped quzah's post, at least I didn't follow the link.

for the most part

Any precision would be appreciated , I read the K&R chapter about this a bit quickly I must confess... But an idea of how this behave with real life libraries would be most welcomed.

Thanks