My program’s much more mundane than using templates as a Turing complete language at compile time. Just a slightly tricky static node pool for a persistent segm

My program’s much more mundane than using templates as a Turing complete language at compile time. Just a slightly tricky static node pool for a persistent segment tree. Allocating a larger pool causes more RAM usage at compile time, at a 20+x ratio. Probably not gonna share code since I didn’t bother to distill it down to the cause.