Using virtual destructors in C++ is essential for proper resource management in cases where you have inheritance and dynamic memory allocation. A virtual destructor ensures that when an object of a derived class is deleted through a base class pointer, the derived class's destructor is called first, allowing for proper cleanup of resources. This helps prevent memory leaks and undefined behavior.
class Base {
public:
virtual ~Base() {
// Base destructor logic
std::cout << "Base destructor called" << std::endl;
}
};
class Derived : public Base {
public:
~Derived() {
// Derived destructor logic
std::cout << "Derived destructor called" << std::endl;
}
};
int main() {
Base* obj = new Derived();
delete obj; // This will call Derived destructor first, then Base destructor
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?