This article discusses an implementation of multidimensional array class with resizable dimensions. Access to subarrays and their swapping are allowed. Benchmarks are provided, which compare the performance of this implementation with Boost and standard C arrays.
This article is a continuation of Programming Concurrency in C++ Part 1. We will discuss synchronization, future and promises along with async and with that, will sum up the introduction of concurrency in C++.
This article proposes a mapping algorithm, called Segmented Map, which is almost as fast as Flat Map is random access and enumeration of elements and close to std::map in insertion of elements.
