// Interface definition
class Drawable {
public:
virtual void draw() = 0; // Pure virtual function
virtual ~Drawable() {} // Virtual destructor
};
// Class that implements the interface
class Circle : public Drawable {
public:
void draw() override {
// Implementation for drawing a circle
std::cout << "Drawing a Circle" << std::endl;
}
};
// Another class that implements the interface
class Square : public Drawable {
public:
void draw() override {
// Implementation for drawing a square
std::cout << "Drawing a Square" << std::endl;
}
};
// Usage
int main() {
Drawable* circle = new Circle();
Drawable* square = new Square();
circle->draw(); // Output: Drawing a Circle
square->draw(); // Output: Drawing a Square
delete circle;
delete square;
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?