Sasha Goldshtein begins to show us how to implement the basis of a useful tool from the STL: the tuple.

Implementing std::tuple From The Ground Up – Part 1

by Sasha Goldshtein

From the article:

std::tuple is a very nice facility originally introduced in C++ TR1. It is a heterogenous container of elements that has a statically known size. In C++ 11, std::tuple can be implemented using variadic templates; a single std::tuple class can support an arbitrary number of template type arguments. In this series of blog posts we will implement std::tuple from first principles. The purpose of this exercise is not to provide the best-performing or most-conformant tuple implementation, but rather to see what foundational concepts are required to implement it...