#include
// Interface definition
class ICalculator {
public:
virtual int add(int a, int b) = 0;
virtual int subtract(int a, int b) = 0;
};
// Implementation of the interface
class Calculator : public ICalculator {
public:
int add(int a, int b) override {
return a + b;
}
int subtract(int a, int b) override {
return a - b;
}
};
// Client code demonstrating the separation
int main() {
ICalculator* calculator = new Calculator();
std::cout << "Addition: " << calculator->add(5, 3) << std::endl;
std::cout << "Subtraction: " << calculator->subtract(5, 3) << std::endl;
delete calculator;
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?