Re: simple question about containers
On May 24, 12:30 pm, Devon Null <theronnights...@gmail.com> wrote:
I was wondering if there is a container (i.e. a vector) that can hold
data structures of differing sizes. I was thinking of something along
the lines of a container of classes. Think of a backpack you can take
items from and put items into of different sizes.
The reason I want to know is I am about to try my hands at learning
classes and need to do it in a way I can grasp - ala gaming concepts
(see inventory example above.)
Thanks in advance.
The backpack isn't storing the specifications of each item.
It simply stores objects, not classes.
It can also store base pointers to derived entities (which is what you
are looking for).
Assuming you have some form of inheritance hierarchy:
class Item {
virtual ~Item() = 0;
};
Item::~Item() { }
class Weapon : public Item { };
class Potion : public Item { };
int main()
{
// Item item; // error, Item is abstract
Weapon weapon;
Potion potion;
std::vector< Item* > inventory;
inventory.push_back( &weapon );
inventory.push_back( &potion );
}
I'ld suggest keeping the base class abstract.
Types Weapon and Potion have their own specific attributes and their
own specific member functions.
Once you are comfortable with such a scenario, do look into smart
pointers (ie: boost:shared_ptr).
Otherwise, you'll need to manage the lifetime of those Items.