Templates can do any computation on integer data elements, true. But they are not so good at I / O.
What form should the answer take? A template that generates a function that, when executed, outputs a quine source? This is not exactly compilation time. A template that generates a list of compile-time characters (hundreds or thousands of classes) that make up a quine source? This may be better, but you still need to run the program to output it.
In addition, the templates are very verbose, and although they are fully completed, that is, only within the limited memory limit recommended by the standard. For example, you can expect so much recursion for which the program is highly dependent on the compiler. It may not be possible to write a “meaningfully calculated” quine, which is stored in a portable form.
source share