list/vector/etc inside struct and delete

When you do not define a destructor, the default behaviour is to call the destructor for each data member and base class.(*)

In your case, there are no bases and the only data member is the list. The list's destructor will therefore be called. This destructor cleans up the list, so there is nothing to do.

You clean up your mess, and the standard library cleans up its mess.

* Even if you do define a destructor, these calls are made as well as running your destructor code. With well-written code using well-designed components, you will almost never have to do any work inside your own destructor - although you will have to at least define an empty, virtual destructor for a base class that will be used polymorphically.

thank you

note that this *will* leak memory

#include <iostream>#include <vector>#include <string>struct foo{  foo() {std::cout << "alloc\n";}  ~foo() {std::cout << "called\n";}  char meh;};struct bar{  std::vector<foo*> list;};int main (){  bar* bPtr = new bar();  bPtr->list.push_back(new foo());  bPtr->list.push_back(new foo());  bPtr->list.push_back(new foo());  delete bPtr;  return 1;}

output:
> ./a.out
alloc
alloc
alloc

so if you are storing pointers, you need to delete each pointer manually (by iterating over the list and call delete on the thing)

Quote:

Original post by _Kami_ so if you are storing pointers, you need to delete each pointer manually (by iterating over the list and call delete on the thing)

Which is why the standard advice given by most people nowdays is to not store raw pointers inside containers.
Using shared_ptr for example, would be part of the "well-written code using well-designed components" Zahlman was referring to.