From Wikipedia, the free encyclopedia
(Redirected from Curiously Recurring Template Pattern)
Jump to navigation Jump to search
The curiously recurring template pattern (CRTP) is an idiom in C++ in which a class X
derives from a class template instantiation using X
itself as template argument.[1] More generally it is known as F-bound polymorphism, and it is a form of F-bounded quantification.
The technique was formalized in 1989 as "F-bounded quantification."[2] The name "CRTP" was independently coined by Jim Coplien in 1995,[3] who had observed it in some of the earliest C++ template code as well as in code examples that Timothy Budd created in his multiparadigm language Leda.[4] It is sometimes called "Upside-Down Inheritance"[5][6] due to the way it allows class hierarchies to be extended by substituting different base classes.
The Microsoft Implementation of CRTP in ATL was independently discovered, also in 1995 by Jan Falkin who accidentally derived a base class from a derived class. Christian Beaumont, first saw Jan's code and initially thought it couldn't possibly compile in the Microsoft compiler available at the time. Following this revelation that it did indeed work, Christian based the entire ATL and WTL design on this mistake.[citation needed]
// The Curiously Recurring Template Pattern (CRTP) templateclass Base { // methods within Base can use template to access members of Derived }; class Derived : public Base { // ... };
Some use cases for this pattern are static polymorphism and other metaprogramming techniques such as those described by Andrei Alexandrescu in Modern C++ Design.[7] It also figures prominently in the C++ implementation of the Data, Context, and Interaction paradigm.[8]
Typically, the base class template will take advantage of the fact that member function bodies (definitions) are not instantiated until long after their declarations, and will use members of the derived class within its own member functions, via the use of a cast; e.g.:
templatestruct Base { void interface() { // ... static_cast (this)->implementation(); // ... } static void static_func() { // ... T::static_sub_func(); // ... } }; struct Derived : Base { void implementation(); static void static_sub_func(); };
In the above example, note in particular that the function Base
This technique achieves a similar effect to the use of virtual functions, without the costs (and some flexibility) of dynamic polymorphism. This particular use of the CRTP has been called "simulated dynamic binding" by some.[9] This pattern is used extensively in the Windows ATL and WTL libraries.
To elaborate on the above example, consider a base class with no virtual functions. Whenever the base class calls another member function, it will always call its own base class functions. When we derive a class from this base class, we inherit all the member variables and member functions that weren't overridden (no constructors or destructors). If the derived class calls an inherited function which then calls another member function, that function will never call any derived or overridden member functions in the derived class.
However, if base class member functions use CRTP for all member function calls, the overridden functions in the derived class will be selected at compile time. This effectively emulates the virtual function call system at compile time without the costs in size or function call overhead (VTBL structures, and method lookups, multiple-inheritance VTBL machinery) at the disadvantage of not being able to make this choice at runtime.
The main purpose of an object counter is retrieving statistics of object creation and destruction for a given class.[10] This can be easily solved using CRTP:
templatestruct counter { static int objects_created; static int objects_alive; counter() { ++objects_created; ++objects_alive; } counter(const counter&) { ++objects_created; ++objects_alive; } protected: ~counter() // objects should never be removed through pointers of this type { --objects_alive; } }; template int counter ::objects_created( 0 ); template int counter ::objects_alive( 0 ); class X : counter { // ... }; class Y : counter { // ... };
Each time an object of class X
is created, the constructor of counter
is called, incrementing both the created and alive count. Each time an object of class X
is destroyed, the alive count is decremented. It is important to note that counter
and counter
are two separate classes and this is why they will keep separate counts of X
's and Y
's. In this example of CRTP, this distinction of classes is the only use of the template parameter (T
in counter
) and the reason why we cannot use a simple un-templated base class.
Method chaining, also known as named parameter idiom, is a common syntax for invoking multiple method calls in object-oriented programming languages. Each method returns an object, allowing the calls to be chained together in a single statement without requiring variables to store the intermediate results.
When the named parameter object pattern is applied to an object hierarchy, things can get wrong. Suppose we have such a base class:
class Printer { public: Printer(ostream& pstream) : m_stream(pstream) {} templatePrinter& print(T&& t) { m_stream << t; return *this; } template Printer& println(T&& t) { m_stream << t << endl; return *this; } private: ostream& m_stream; };
Prints can be easily chained:
Printer{myStream}.println("hello").println(500);
However, if we define the following derived class:
class CoutPrinter : public Printer { public: CoutPrinter() : Printer(cout) {} CoutPrinter& SetConsoleColor(Color c) { ... return *this; } };
we "lose" the concrete class as soon as we invoke a function of the base:
v-- we have a 'Printer' here, not a 'CoutPrinter' CoutPrinter().print("Hello ").SetConsoleColor(Color.red).println("Printer!"); // compile error
This happens because 'print' is a function of the base - 'Printer' - and then it returns a 'Printer' instance.
The CRTP can be used to avoid such problem and to implement "Polymorphic chaining":[11]
// Base class templateclass Printer { public: Printer(ostream& pstream) : m_stream(pstream) {} template ConcretePrinter& print(T&& t) { m_stream << t; return static_cast (*this); } template ConcretePrinter& println(T&& t) { m_stream << t << endl; return static_cast (*this); } private: ostream& m_stream; }; // Derived class class CoutPrinter : public Printer { public: CoutPrinter() : Printer(cout) {} CoutPrinter& SetConsoleColor(Color c) { ... return *this; } }; // usage CoutPrinter().print("Hello ").SetConsoleColor(Color.red).println("Printer!");
When using polymorphism, one sometimes needs to create copies of objects by the base class pointer. A commonly used idiom for this is adding a virtual clone function that is defined in every derived class. The CRTP can be used to avoid having to duplicate that function or other similar functions in every derived class.
// Base class has a pure virtual function for cloning class Shape { public: virtual ~Shape() {}; virtual Shape *clone() const = 0; }; // This CRTP class implements clone() for Derived templateclass Shape_CRTP : public Shape { public: virtual Shape *clone() const { return new Derived(static_cast (*this)); } }; // Nice macro which ensures correct CRTP usage #define Derive_Shape_CRTP(Type) class Type: public Shape_CRTP // Every derived class inherits from Shape_CRTP instead of Shape Derive_Shape_CRTP(Square) {}; Derive_Shape_CRTP(Circle) {};
This allows obtaining copies of squares, circles or any other shapes by shapePtr->clone()
.