Meta Monads

on YouTube ↗06m

" summary

meta monads describes a compile-time pattern that separates algorithm from data to avoid creating many intermediate types, using aliases inside specialized template structs so the compiler memorizes the algorithm not the data. It adds fast track generators that remove blocks of types (powers of two) and a reusable control structure to implement take/drop/find_if variants. Reported speedups: ~30x for take versus prior metal, ~5–6x for find_if, with room for another order of magnitude.

AI-written summary · about

" chapters (7)

1. 0:00Introduction to Metamon
2. 0:10The problem with naive methods
3. 0:53Optimizing meta programs
4. 2:04Fast tracking techniques
5. 2:41Using specialized templates
6. 4:26Implementing control structures
7. 5:07Performance results and Q&A

" related talks

• 36mThe language that isn'tEsteban Kuber · RustFest LATAM 2022
• 49mA new look at TMPIvan Čukić · Meeting C++ 2018
• 01h 04mWhat Can Compiler Benchmarks Reveal About Metaprogramming Implementation StrategiesVincent Reverdy · CppCon 2022
• 59mTemplate Metaprogramming: Type Traits (part 2 of 2)Jody Hagins · CppCon 2020
• 41mTemplate meta-programming: Why you must get itManuel Sanchez · Meeting C++ 2015
• 05mLightning Talk: MP: Template Meta-Programming in C++Kris Jusiak · CppCon 2022
• 56mboost.tmp: your DSL for MetaprogrammingOdin Holmes · Meeting C++ 2018
• 01h 03mMeta Techniques: Heterogeneous Polymorphism & Fast Prototyping at FacebookM. Juchem · CppCon 2014