The Curiously Recurring Template Pattern (CRTP) is a C++ idiom that allows a class to inherit from a template instantiation of itself. This pattern is useful for various purposes, such as implementing static polymorphism, enforcing interfaces, and facilitating code reuse.
#include
template
class Base {
public:
void interface() {
// Calls a method in the derived class
static_cast(this)->implementation();
}
// A method to be overridden
void implementation() {
std::cout << "Base implementation" << std::endl;
}
};
class Derived : public Base {
public:
void implementation() {
std::cout << "Derived implementation" << std::endl;
}
};
int main() {
Derived d;
d.interface(); // Will call Derived's implementation
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?