*
Peter,
I can confirm peeking at the code that at least clang ships a naive linear recursion implementation of make_index_sequence and I read somewhere that GCC doesn't do any better, however it's well known http://stackoverflow.com/a/17426611/801438 it may be implemented in O(log(n)) plus taking full advantage of memoization. Since Part 2 of your article is all about benchmarking, have you actually tried it? I see your "duplicate immune" version of mp_contains_impl and also mp_map_find and hence mp_at depend on it, so I would expect one to see measurable improvements on their benchmarks. Following is an implementation if
Following is an implementation of it
templatestd::size_t...
struct indices
{
using type = indices;
};
template