From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.6 required=5.0 tests=BAYES_05,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4fe37c439e7925b4
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-10-20 14:20:17 PST
Path: 
 bga.com!news.sprintlink.net!howland.reston.ans.net!swrinde!sgiblab!uhog.mit.edu!news.mathworks.com!news2.near.net!news.delphi.com!usenet
From: tmoran@bix.com
Newsgroups: comp.lang.ada
Subject: Re: compilation time [was Re: Magnavox consultant]
Date: 20 Oct 1994 21:01:53 GMT
Organization: Delphi Internet Services Corporation
Message-ID: <386ls1$lu7@news.delphi.com>
NNTP-Posting-Host: bix.com
Date: 1994-10-20T21:01:53+00:00
List-Id: <comp.lang.ada>

> A 2200-line program is not likely to have many with clauses per
> compilation unit.  ... cannot be assumed that this test scales up
> to a large program with complex dependencies among compilation units.
That raises the interesting question of how the number of with's
scales with total program size in the real world.  Presumably in a
good modular design it's much less than linear, but how much?  There
are rules of thumb about 'a single module shouldn't be more than
N lines' - should a single module not have more than M with's?