Template metaprogramming

The use of templates as a metaprogramming technique requires two distinct operations: a template must be defined, and a defined template must be instantiated. The generic form of the generated source code is described in the template definition, and when the template is instantiated, the generic form in the template is used to generate a specific set of source code. Template metaprogramming is Turing-complete, meaning that any computation expressible by a computer program can be computed, in some form, by a template metaprogram. Templates are different from macros. A macro is a piece of code that executes at compile time and either performs textual manipulation of code to-be compiled (e.g. C++ macros) or manipulates the abstract syntax tree being produced by the compiler (e.g. Rust or Lisp macros). Textual macros are notably more independent of the syntax of the language being manipulated, as they merely change the in-memory text of the source code right before compilation. Template metaprograms have no mutable variables— that is, no variable can change value once it has been initialized, therefore template metaprogramming can be seen as a form of functional programming. In fact many template implementations implement flow control only through recursion, as seen in the example below. Using template metaprogramming Though the syntax of template metaprogramming is usually very different from the programming language it is used with, it has practical uses. Some common reasons to use templates are to implement generic programming (avoiding sections of code which are similar except for some minor variations) or to perform automatic compile-time optimization such as doing something once at compile time rather than every time the program is run — for instance, by having the compiler unroll loops to eliminate jumps and loop count decrements whenever the program is executed. ==Compile-time class generation==

What exactly "programming at compile-time" means can be illustrated with an example of a factorial function, which in non-template C++ can be written using recursion as follows: uint32_t factorial(uint32_t n) { return n == 0 ? 1 : n * factorial(n - 1); } // Usage examples: // factorial(0) would yield 1; // factorial(4) would yield 24. The code above will execute at run time to determine the factorial value of the literals 0 and 4. By using template metaprogramming and template specialization to provide the ending condition for the recursion, the factorials used in the program—ignoring any factorial not used—can be calculated at compile time by this code: template struct Factorial { static constexpr uint32_t VALUE = N * Factorial::VALUE; }; template <> struct Factorial { static constexpr uint32_t VALUE = 1; }; // Usage examples: // Factorial::value would yield 1; // Factorial::value would yield 24. The code above calculates the factorial value of the literals 0 and 4 at compile time and uses the results as if they were precalculated constants. To be able to use templates in this manner, the compiler must know the value of its parameters at compile time, which has the natural precondition that Factorial::value can only be used if X is known at compile time. In other words, X must be a constant literal or a constant expression. In C++11 and C++20, constexpr and consteval were introduced to let the compiler execute code. Using and , one can use the usual recursive factorial definition with the non-templated syntax. ==Compile-time code optimization==

The factorial example above is one example of compile-time code optimization in that all factorials used by the program are pre-compiled and injected as numeric constants at compilation, saving both run-time overhead and memory footprint. It is, however, a relatively minor optimization. As another, more significant, example of compile-time loop unrolling, template metaprogramming can be used to create length-n vector classes (where n is known at compile time). The benefit over a more traditional length-n vector is that the loops can be unrolled, resulting in very optimized code. As an example, consider the addition operator. A length-n vector addition might be written as template ColumnVector& ColumnVector::operator+=(const Vector& rhs) { for (int i = 0; i When the compiler instantiates the function template defined above, the following code may be produced: template <> ColumnVector& ColumnVector::operator+=(const ColumnVector& rhs) { value[0] += rhs.value[0]; value[1] += rhs.value[1]; return *this; } The compiler's optimizer should be able to unroll the for loop because the template parameter Length is a constant at compile time. However, care must be taken as this may cause code bloat, since separate unrolled code will be generated for each 'N'(vector size) the template is instantiated with. ==Static polymorphism==

Polymorphism is a common standard programming facility where derived objects can be used as instances of their base object but where the derived objects' methods will be invoked, as in this code class Base { public: virtual void method() { std::println("Base"); } virtual ~Base() {} }; class Derived : public Base { public: virtual void method() { std::println("Derived"); } }; int main() { Base* b = new Derived; b->method(); // outputs "Derived" delete b; return 0; } where all invocations of virtual methods will be those of the most-derived class. This dynamically polymorphic behaviour is (typically) obtained by the creation of virtual look-up tables for classes with virtual methods, tables that are traversed at run time to identify the method to be invoked. Thus, run-time polymorphism necessarily entails execution overhead (though on modern architectures the overhead is small). However, in many cases the polymorphic behaviour needed is invariant and can be determined at compile time. Then the Curiously Recurring Template Pattern (CRTP) can be used to achieve static polymorphism, which is an imitation of polymorphism in programming code but which is resolved at compile time and thus does away with run-time virtual-table lookups. For example: template struct Base { void myMethod() { // ... static_cast(this)->myImplementation(); // ... } }; struct Derived : Base { void myImplementation() { // ... } }; Here the base class template will take advantage of the fact that member function bodies are not instantiated until after their declarations, and it will use members of the derived class within its own member functions, via the use of a static_cast, thus at compilation generating an object composition with polymorphic characteristics. As an example of real-world usage, the CRTP is used in the Boost iterator library. Another similar use is the "Barton–Nackman trick", sometimes referred to as "restricted template expansion", where common functionality can be placed in a base class that is used not as a contract but as a necessary component to enforce conformant behaviour while minimising code redundancy. == Static Table Generation ==

The benefit of static tables is the replacement of "expensive" calculations with a simple array indexing operation (for examples, see lookup table). In C++, there exists more than one way to generate a static table at compile time. The following listing shows an example of creating a very simple table by using recursive structs and variadic templates. The table has a size of ten. Each value is the square of the index. import std; using std::array; constexpr int TABLE_SIZE = 10; /** * Variadic template for a recursive helper struct. */ template struct Helper : Helper { }; /** * Specialization of the template to end the recursion when the table size reaches TABLE_SIZE. */ template struct Helper { static constexpr array TABLE = { D... }; }; constexpr array TABLE = Helper<>::TABLE; enum class Numbers { FOUR = TABLE[2] // compile time use }; int main() { for (int i: TABLE) { std::println("{}", i); // run time use } std::println("FOUR: {}", Numbers::FOUR); } The idea behind this is that the struct Helper recursively inherits from a struct with one more template argument (in this example calculated as Index * Index) until the specialization of the template ends the recursion at a size of 10 elements. The specialization simply uses the variable argument list as elements for the array. The compiler will produce code similar to the following (taken from clang called with ). import std; using std::array; template struct Helper : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> : Helper {}; template <> struct Helper> { static constexpr array TABLE = {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}; }; Since C++17 this can be more readably written as: import std; using std::array; constexpr int TABLE_SIZE = 10; constexpr array TABLE = []() -> array { array a = {}; for (size_t i = 0; i To show a more sophisticated example the code in the following listing has been extended to have a helper for value calculation (in preparation for more complicated computations), a table specific offset and a template argument for the type of the table values (e.g. , , ...). import std; using std::array; constexpr int TABLE_SIZE = 20; constexpr int OFFSET = 12; /** * Template to calculate a single table entry */ template struct ValueHelper { static constexpr ValueType VALUE = Offset + Index * Index; }; /** * Variadic template for a recursive helper struct. */ template struct Helper : Helper::VALUE> { }; /** * Specialization of the template to end the recursion when the table size reaches TABLE_SIZE. */ template struct Helper { static constexpr array TABLE = { D... }; }; constexpr array TABLE = Helper::TABLE; int main() { for (int i: TABLE) { std::println("{}", i); } } Which could be written as follows using C++17: import std; using std::array; constexpr int TABLE_SIZE = 20; constexpr int OFFSET = 12; template constexpr array TABLE = []() -> array { array A = {}; for (size_t i = 0; i ) { std::pritnln("{}", i); } } ==Concepts==

The C++20 standard brought C++ programmers a new tool for meta template programming, concepts. Concepts allow programmers to specify requirements for the type, to make instantiation of template possible. The compiler looks for a template with the concept that has the highest requirements. Here is an example of the famous Fizz buzz problem solved with Template Meta Programming. import std; import boost.type_index; // for pretty printing of types using std::tuple; using boost::typeindex::type_id; /** * Type representation of words to print */ struct Fizz {}; struct Buzz {}; struct FizzBuzz {}; template struct Number { constexpr static size_t N = M; }; /** * Concepts used to define condition for specializations */ template concept HasN = requires { requires A::N - A::N == 0; }; template concept FizzConc = HasN && requires { requires A::N % 3 == 0; }; template concept BuzzConc = HasN && requires { requires A::N % 5 == 0; }; template concept FizzBuzzC = FizzConc && BuzzConc; /** * By specializing `res` structure, with concepts requirements, proper instantiation is performed */ template struct Res; template struct Res { using Result = FizzBuzz; }; template struct Res { using Result = Fizz; }; template struct Res { using Result = Buzz; }; template struct Res { using Result = X; }; /** * Predeclaration of concatenator */ template struct Concatenator; /** * Recursive way of concatenating next types */ template struct Concatenator> { using Type = typename Concatenator>::Result, Args...>>::Type; }; /** * Base case */ template struct Concatenator> { using Type = tuple; }; /** * Final result getter */ template using FizzBuzzFull = typename Concatenator>::Result>>::Type; int main(int argc, char* argv[]) { // printing result using boost.type_index, so it's clear std::println("{}", type_id>().pretty_name()); } /* Result: std::tuple, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz, Number, Fizz, Number, Number, FizzBuzz, Number, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz, Number, Fizz, Number, Number, FizzBuzz, Number, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz, Number, Fizz, Number, Number, FizzBuzz, Number, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz, Number, Fizz, Number, Number, FizzBuzz, Number, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz, Number, Fizz, Number, Number, FizzBuzz, Number, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz, Number, Fizz, Number, Number, FizzBuzz, Number, Number, Fizz, Number, Buzz, Fizz, Number, Number, Fizz, Buzz> • / ==Benefits and drawbacks of template metaprogramming==

Compile-time versus execution-time tradeoffs get visible if a great deal of template metaprogramming is used. • Template metaprogramming allows the programmer to focus on architecture and delegate to the compiler the generation of any implementation required by client code. Thus, template metaprogramming can accomplish truly generic code, facilitating code minimization and better maintainability. • With respect to C++ prior to version C++11, the syntax and idioms of template metaprogramming were esoteric compared to conventional C++ programming, and template metaprograms could be very difficult to understand. But from C++11 onward the syntax for value computation metaprogramming becomes more and more akin to "normal" C++, with less and less readability penalty. ==See also==