Explore the power of C++ templates, from function and class basics to advanced features like instantiation and concepts, enhancing code flexibility, reusability, and abstraction without performance loss.

cpp17.tar.gz

C++17

C++20

Templates are one of the many powerful features of Modern C++ programming. And with each new C++ standard, they become more important. 

Templates provide an efficient way to make your code more flexible and reusable, this way you can avoid repeating code that would otherwise be identical except for different types. Templates also give you the ability to provide abstraction without a performance penalty.

However, templates can be difficult to apply, can be counterintuitive, and have tricky error messages.

This course gives you the necessary information to overcome these hurdles and dive into the advanced topics. You’ll visit the basics such as function and class templates, and then explore the details to templates such as instantiation and fold expressions. Our journey also includes techniques based on templates, the design, and future directions of templates such as concepts. Based on this exhaustive tour of templates, a basic understanding of C++ is sufficient to master this course.

Let’s get started!

Generic Programming Templates in C++

// templateFactorial.cpp

#include <iostream>

template <int N> 
struct Factorial{
    static int const value = N * Factorial<N-1>::value;
};

template <> 
struct Factorial<1>{
    static int const value = 1;
};

int main(){
    std::cout << Factorial<10>::value << std::endl;
}


## Explanation

The `Factorial` function calls itself recursively by storing the result of each iteration in `value`. For the base case, the result is multiplied by 1 in line 12 and the answer is stored in value.

> To be precise, what looks like a recursion, like in the case of `Factorial`, is not a recursion. Each invocation of `Factorial<N>` triggers a new instantiation `Factorial<N-1>` in line 7. 

Let's have a look at a solution review for the last exercise.

Introduction

Basics

Details

Techniques

Design

Future

Conclusion

- Solution

Solution Review