Revision as of 13:50, 27 October 2023 edit TamaMcGlinn (talk \| contribs) 41 edits Turing completeness of Template metaprogramming in C++ is not an opinion, but a proven fact ← Previous edit		Revision as of 14:27, 27 October 2023 edit undo TamaMcGlinn (talk \| contribs) 41 edits →Advantages and limits - change wording; you can do arbitrary computations inside generics, but those get done at runtime. It is not TMP because generics are not templates, but this is just terminology. Next edit →
Line 195: * all instances of a generic being exactly the same, it is easier to review and understand programs written by others; there are no "special cases" to take into account. * all instantiations being explicit, there are no hidden instantiations that might make it difficult to understand the program. * Ada does not permit ~~"template~~arbitrary ~~metaprogramming"~~computation at compile time, because itoperations on generic arguments ~~does~~are ~~not~~performed ~~allow~~at ~~specialisations~~runtime. ====Templates in C++====

Generic programming: Difference between revisions