From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 14 Aug 91 19:15:37 GMT
From: haven.umd.edu!uvaarpa!software.org!smithd@purdue.edu  (Doug Smith)
Subject: Re: c++ vs ada results
Message-ID: <1991Aug14.191537.21797@software.org>
List-Id: <comp.lang.ada>

In article <1991Aug14.182554.16576@software.org> smithd@software.org (Doug Smit
h) writes:
> In article <1991Aug14.050358.19787@beaver.cs.washington.edu> mfeldman@june.cs
.washington.edu (Mike Feldman) writes:
> > In article <1991Aug13.142900.28910@slcs.slb.com> cornish@slcs.slb.com (Darr
yl Cornish) writes:
> > >
> 
> It is possible to take an algorithmic approach to building these
> utilities.  This creates a smaller library of generics that provide the
> same capabilities.  If my memory serves, a conservative estimate was a
> reduction from 1000+ to about 150 generic packages.  I would also
> predict an increase in the number of utilities that could be constructed
> from the 150 generics.

Well, I finally found an old copy of the paper, and my age has warped
my memory.  The number of Booch components is 501 (not 1000+), and the
prediction was that only a "few dozen" generics would be needed if the
algorithmic approach was used.

Additionally, the memory management utilites consisted of 7 (3 + 2 + 2)
generic packages that implemented 12 (3 * 2 *2) utilities.  It should
still be obvious how powerful the approach is as the number of generics
increases.

Please send your flames directly to me.  I deserve them for not checking
the facts first.