Reducing variadic template combinatorics (C++ was onto something)

[monkyyy]

On Tuesday, 14 October 2025 at 04:30:49 UTC, Steven Schveighoffer 
wrote:
> In a conversation on a pull request for one of my libraries, I 
> came across an interesting revelation. Variadic template 
> functions waste resources for the most part, because much of 
> the time, you don't care about the *relationship* between the 
> parameters. In many such functions, you just process them in a 
> loop.
>
> [...]

I have fun ideas but youd need a benchmark; while I think I know 
how to estimate the big O of dmd, theres always the fun edge cases