Working with dynamic memory in C++

hi!

I'm working on a project which I can't use vectors, lists, etc... but only dynamic memory :-(
Being new to C++, i don't know how to "save" blocks of data in dynamic memory.

Theres what i need to do:
I have to make a program for a grocery store. In this store the clients can order products and what i need to keep in dynamic memory are each clients orders.

Order Data:
- Client Name
- The products the client wants
- Total price

But i don't know how to do this without using vectors or lists...
Can anyone help me?

Quote:

---

Originally Posted by IndioDoido

I'm working on a project which I can't use vectors, lists, etc... but only dynamic memory :-(

---

Sounds like a class assignment, right?

Quote:

---

But i don't know how to do this without using vectors or lists...

---

A basic vector is pretty easy to implement. Look for tutorials. You should be able to find one.

Once you have that, just solve it how you would have done with std::vector. After all, they can't fault you for properly encapsulating your dynamic memory management, can they?

hey CornedBee, thanks for the fast reply ;-)

yap! it's a class assignment :-S

i don't really know if they mean i can't use the std::vector, or both (basic vector and std::vector). I have to ask them.

Anyway, can std::set be used as an alternative to std::vector? Or am i saying something really stupid? :-S

std::set is a map, from what I understand, but std::vector is a vector, or an array. Two different things.
A map can be a good thing to find a certain item, so to speak. Say, you lookup your client's name and find the total price, etc.
A vector is simply a class to store information, much like an array. Good when you don't need to lookup something by things as name. In vectors, indexes are used.
Although a vector is much faster than a map if you wish to retrieve data.

I doubt you can use any standard container if they specifically say don't use vector or list, which means that set and map are likely out.

Also, vector is the same as std::vector. Those are just two different ways to refer to it.

As far as what to do, do you know how to create a dynamic array? You should have a class that stores the data in a dynamic array. It should be able increase the size of the array and delete the array in the destructor. If you're smart, you'll actually make the class that handles the resizing and construction and deletion separate from the classes that handle the grocery stuff as CornedBee suggested, but I doubt that is necessarily expected for the assignment.

Thanks for the explanation Elysia, i was really saying something stupid :-)

hi Daved, i have already created a class orders, example:

Code:

---

class order
{
        string clientName;
        unsigned int numProducts;
        unsigned int orderID;
        unsigned int productID;
unsigned int totalPrice;

public:
        ...

};

---

now, is this what you mean with dynamic array?

Code:

---

order *arrayOrder;

---

Sounds like your teacher wants you to create your own vector or list structure...
Do some reading about Linked Lists. They're pretty simple once you see it.

>> is this what you mean with dynamic array?
That's a start. It's a declaration of a pointer that can point to a dynamic array if you make it. Now how would you actually create the dynamic array and have arrayOrder point to it?

hi Daved

yes! that's it...