// Example of a polymorphic hierarchy in C++
class Shape {
public:
virtual void draw() = 0; // Pure virtual function
virtual ~Shape() {} // Virtual destructor for safety
};
class Circle : public Shape {
public:
void draw() override {
// Implementation for Circle
std::cout << "Drawing Circle" << std::endl;
}
};
class Square : public Shape {
public:
void draw() override {
// Implementation for Square
std::cout << "Drawing Square" << std::endl;
}
};
void renderShapes(const std::vector& shapes) {
for (const auto& shape : shapes) {
shape->draw(); // Safely call the appropriate draw method
}
}
int main() {
std::vector shapes;
shapes.push_back(new Circle());
shapes.push_back(new Square());
renderShapes(shapes);
// Cleanup
for (Shape* shape : shapes) {
delete shape; // Prevent memory leaks
}
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?