C++: The Multilist class – third part

In the previous post, we fix the problem with cascading calls to the copy constructor. Next, we are going to implement a version of the get method that executes forward retrieval.

C++: The Multilist class – second part

In the previous post, we have implemented a first version of the Multilist container. However, we pointed out two drawbacks in that implementation: First, there were an excessive number of copies been done; secondly, the get method was operating backwards, i.e., the first value retrieved is located in the last list. In this post we solve the first of these problems, and we take the opportunity to talk about rvalues and move operations.

C++: The Multilist class first part

The goal of this post is to construct a class that sequentially stores any number of containers of different types. Ultimately, we are going to create the function get that, given a list of indexes and a list of reference variables, it stores the indexed elements in the respective reference variables.

Organize and document everything you can

Imagine one day you woke up in a house in the middle of the woods. You have to find the way back home but you haven’t a map. You follow your intuition and try different paths. There are hundreds of them, like in a labyrinth. If you do not have a prodigious memory, you will inevitably forget which paths you have taken and anxiety will take over you. You better document all the paths you tried, and create your own map.

C++: Expression expansion

In the previous post we use recursive meta-programming to code a function that prints some indexed elements in a sequence of sets. In this post we explore an alternative that uses expression expansion, available since C++11.