tuple | Implementation of a wonderful tuple

tuple is a C++ library. tuple has no bugs, it has no vulnerabilities and it has low support. You can download it from GitHub.

We start by defining our own tuple. To this end:. We start by the definition of our tuple: it has a first integral parameter containing the dimension, and then the list of types contained in the tuple. The tuple dimension gets forwarded to all the hierarchy of objects, and it is used to compute the "s_index" (the position of the element in the tuple), as shown below. We have two template specializations: one for the generic case, and one for the empty tuple (which represents the last child in the hierarchy, and stops all template recursions). The generic case looks as follows (we omit the constructor for the moment). while the case stopping the recursion (not inheriting from anything). Notice the presence of std::move in a couple of occasion: that's in order to call move constructors (when defined) instead of copy constructors, so that we can handle move-only objects (like std::unique_ptr, std::future) as well. This will become clearer later on. We left undefined the "access" metafunction, which is used like the operator[] in an array: given an index N it returns the value contained in the Nth element. In practice it concatenates ::super N times.