Would you like to gain 20…35 or even 50% speed improvements when searching in associative containers? In this blog post, we’ll explore a technique called “heterogenous access” that offers such impressive speedups. We’ll explore ordered containers, and the support for unordered collections added recently in C++20.
Recap on heterogeneous lookup in ordered containers Let’s bring the example and have a look at how this feature works for ordered containers.