Jan 29 · 4 min read · In the previous chapters, we treated our TypePack primarily as a linear sequence—a list that can be sliced, grown, and flattened. However, in many metaprogramming scenarios, a parameter pack acts more like a Set. You might need to know if a specific ...
Join discussion
Jan 25 · 3 min read · As we build more complex template systems, we often find ourselves with "packs within packs." This usually happens when merging multiple results from different metafunctions or dealing with recursive type generators. While a nested structure has its ...
Join discussion
Jan 21 · 3 min read · In the previous chapters, we focused on "positional" operations: doing things based on indices and ranges. However, in real-world metaprogramming, we often care about what a type is, not just where it is. For example, you might want to strip all void...
Join discussion
Jan 19 · 3 min read · Part 5: Refining the Pack — Deletion and Range Removal In the previous chapters, we focused on building and expanding our TypePack. However, effective type manipulation often requires surgical precision in removing unwanted elements. Whether you're s...
Join discussion
Jan 15 · 3 min read · In the previous parts, we learned how to encapsulate a variadic pack and how to slice it into smaller pieces. However, a truly flexible meta-container must also be able to grow. In this article, we will implement the ability to merge multiple TypePac...
Join discussion
Jan 11 · 4 min read · In the previous part, we learned how to measure a TypePack and pick a single element. However, when building complex template libraries, we often need more than just one type; we need to extract entire chunks of data. Whether you are stripping away m...
Join discussion
Jan 7 · 3 min read · In the first part of this series, we introduced the TypePack as a container to "capture" variadic template arguments. However, a container is only useful if we can inspect its contents. In this article, we will implement two fundamental operations: q...
Join discussion