Improve Compile Time With One Weird Trick Template Meta Programmers Hate!
summary
Converts compile-time type queries into runtime string comparisons by turning types into type-erased array of string_view entries indexed to the original tuple, implements constexpr binary search over those string_views, and exposes set operations (union/intersection/difference/symmetric difference) over tuples. Benchmarks show Hana goes polynomial (extrapolated n^3, would hit ~6 hours) and blows past 51 GB at ~400 elements, while the CIB Tuple approach stays roughly linear and under ~200 MB up to 1,000 elements. CIB Tuple set operations appear practical.
AI-written summary · about
related talks
01h 23mHow C++20 Can Simplify std::tuple
01h 30mRethinking the Way We Do Templates in C++
01h 08mC++ Metaprogramming: A Paradigm Shift
01h 37mRethinking the Way We Do Templates in C++ even more
47mReducing Template Compilation Overhead, Using C++11, 14, 17, and 20.
01h 34mMetaprogramming in C++14
01h 00mModern Template Metaprogramming: A Compendium, Part I
30mTalking to Typelists