i need to make a class that can store anything (integers,objects,etc)
it needs to maintain a list of pointers to these objects
the list needs to be resized to accomodate more elements
i can't use any special classes

i just can't seem to figure it out.

i've got a pointer,

void *storage

which will point to the start of the list

then there will be one pointer, every 4 bytes (sizeof(void*))

which i *think* i can access by doing

storage[index*sizeof(void*)]

i'm not sure if I need to cast that to a void pointer or not, since
that's already what it's defined as...

but then to resize this beast, i'm completely lost

i create a new void pointer..

void* temp = new void*[length]

where length is the new size (how many pointers it will hold)

which should allocate length*4 bytes of memory...

and then i tried doing

"Mark" gmail.com> wrote in message
news:1160084668.203213.75030@c28g2000cwb.googlegroups.com...

A template would be much better. Then you can store an array of T* for almost any type T. If you use
void* you'll need to cast from void* to the correct type whenever you read the array, which is
pretty horrible. Anyway, I'll press on with your non-template version.

It should be void **storage, not void*. Remember, the elements of the array are themselves void *,
and 'storage' is a pointer to the first one, so it's void **.

Mark skrev:

[snip]

Sure... std::vector<>

/Peter

Mark gmail.com> wrote:

You might want to use a vector of the Standard
Template Library (STL). Vectors are essentially resizeable arrays.

Your online docs - or STL tutorials - will have vector examples
you can work from.

At first glimse, it can seem a bit strange that you have to deal
with iterators instead of pointers, but the iterators are really just
pointers that are dressed up fancy for mating with STL algorithms.

HTH/ON

peter koch wrote:

Mark wrote:

i was referring specifically to vectors and such.
but thanks for trying.

David W wrote:

Mark wrote:

Mark schrieb:

David W wrote:

Thomas J. Gritzan wrote: