Article View: comp.std.c++
Article #1114Re: Recursive templates
From: Jim Adcock
Date: Fri, 20 Nov 1992 00:41
Date: Fri, 20 Nov 1992 00:41
8 lines
788 bytes
788 bytes
In article <5225@holden.lulea.trab.se> jbn@lulea.trab.se (Johan Bengtsson) writes: |N-dimension matrixes should be possible to base on N-1-dimension matrixes, |with 1-dimensional matrixes (arrays) as the recursion-stopper. | |The details are left as an exercise for the reader (:-). Similarly there's the old example of recursively implementing a 2^n times- the-range LongInt class based on a 2^(n-1) times-the-range implementation.
Technical Details
Message-ID:
<1992Nov20.004150.21737@microsoft.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!microsoft!hexnut!jimadReferences:
<Bxu3J4.F93@news.cso.uiuc.edu> <5225@holden.lulea.trab.se>Show Full Headers
Complete Article Headers
Newsgroups: comp.std.c++ Path: arc1-ca.pugleaf.net!sparky!uunet!microsoft!hexnut!jimad From: jimad@microsoft.com (Jim Adcock) Subject: Re: Recursive templates Message-ID: <1992Nov20.004150.21737@microsoft.com> Date: 20 Nov 92 00:41:50 GMT Organization: Microsoft Corporation References: <Bxu3J4.F93@news.cso.uiuc.edu> <5225@holden.lulea.trab.se> Lines: 9