Hail I''m working on a class that can store any datatype defined. The big thing with this dataclass it that it have to handle unknown number of items. To do this I create two Item pointer, DataItemPointer will point to a dynamic memory location. When this dynamic memory array is full I need to allocate more. I allocate with DataItemPointerTemp more memory, and then redirect the DataItemPointer to the new memory array. I now realizes that this isn''t a good idea. That''s allot of memory to allocate after awhile. But I cant think of a better way. I don''t want a Linked list, because I want to access the array for processing. With a linked list you have to remove a item before you can access the next. Or you can do it....but it will be long addresses. I want to copy the PlanetData adresses in the old DataItemPointer array to the new DataItemPointerTemp array. New 5 array empty Old 2 array Pointer FULL ==DataItemPointerTemp== ==DataItemPointer== Array PlanetData PlanetData [Adress 2] [NULL][NULL] [Adress 0] [Xpos:3][Ypos:44] [Adress 3] [NULL][NULL] [Adress 1] [Xpos:85][Ypos:23] [Adress 4] [NULL][NULL] [Adress 5] [NULL][NULL] [Adress 6] [NULL][NULL] This is getting complicated, but if I redirect the DataItemPointerTemp array to the DataItemPointer there will be some dynamic allocations left not deleted. Humm..... I need to copy the data inside the PlanetData struct instead. Does anyone have a good idea how I can do this....? If you dont understand what I mean post it!!

I didn't read through all of your code, so I don't know if this will work for you, but have you looked into vectors? They'll handle any data type and can increase/decrease to suit you. They also can be accessed as arrays. They're part of the STL, so you should be able to find lots of info on them. They're real easy to use. They work like a stack.

vector v; // the part in brackets could be any data typev.push_back(1);v.push_back(2);v.push_back(3);for (int i=0; i<v.size(); i++){    cout << v << endl;}v.pop_back(); // removes last element (3)  

They have a bunch of other method's also to manipulate them. Well, I hope that will work for you.

- David

[edited by - BitBlt on June 24, 2002 2:34:59 PM]

quote:Original post by Leadorn
I''m working on a class that can store any datatype defined.

Homogeneously or heterogeneously? If the former, use templates. If the latter, go to the Boost website and check out boost::any.

[ C++ FAQ Lite | ACCU | Boost | Python | Agile Manifesto! ]

All I'm gonna say is look into templates bro. Templates.

Avast ye cantankerous rapscallions, I was all set to be big and bad with my templates answer and you both beat me to it. DAMN THE BOTH OF YOU! DAMN YOU!

[edited by - Funkymunky on June 24, 2002 2:39:20 PM]

Okey i will take a look on vektors.


This will explain some...!!
http://www.geocities.com/leadorn/DataClass.jpg