The fastest possible metafunction? - Template Metaprogramming in C++ - E13

In the last episode we identified a problem with our latest optimization (the defaults implementation): We are unable to scale up the number of default arguments (= better performance on big inputs) without significantly hurting our performance on small inputs! In this episode we introduce a new technique that remedies this problem. After a brief recap of the defaults implementation we create a new implementation that will improve upon the old one for both big and small inputs!

-- TIMESTAMPS --
00:00 - Intro
00:40 - Recap: remove_if
02:01 - Recap: defaults implementation
03:12 - Goal of new implementation
03:30 - The selection optimization
05:24 - Implementation
08:42 - Performance
10:51 - Next optimization opportunity
11:20 - The problem of composition

If you have any questions or feedback, just leave a comment below.

See you next time!