🚀 go-pugleaf

In <1992Nov16.220526.21566@borland.com> pete@borland.com (Pete Becker) writes:

>In article <83733@ut-emx.uucp> jamshid@emx.cc.utexas.edu (Jamshid Afshar) writes:
>>Has ANSI decided anything about the expansion of a recursive template
>>definition?

>	template <unsigned n> class Factorial
>	{
>	public:
>		unsigned eval() { return n*Factorial<n-1>.eval(); }
>	};

>	class Factorial<0>
>	{
>	public:
>		unsigned eval() { return 1; }
>	};

>	#include <iostream.h>

>	int main()
>	{
>	Factorial<6> f6;
>	cout << f6.eval() << endl;
>	return 0;
>	}

*****>	Has anyone got a *real* justification for this?  This is a very
	obfuscated way of writing factorial.
-- 
	- Paul J. Lucas				University of Illinois	
	  AT&T Bell Laboratories		at Urbana-Champaign
	  Naperville, IL			pjl@cs.uiuc.edu