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: 18 May 93 19:24:47 GMT From: dog.ee.lbl.gov!network.ucsd.edu!usc!howland.reston.ans.net!europa.eng.gte fsd.com!emory!sol.ctr.columbia.edu!The-Star.honeywell.com!saifr00.cfsat.honeywe ll.com!shanks@ucbvax.Berkeley.EDU (Mark Shanks) Subject: Re: McCabe package for Ada? Message-ID: <1993May18.192447.9259@saifr00.cfsat.honeywell.com> List-Id: In article raj2@Isis.MsState.Edu (rex allan j ones) writes: > Could someone please point me in the direction of a metrics package >to compute McCabe's Cyclomatic Complexity for Ada programs? > Thank you! >-- Not that this answers your question, but since you bring it up :) Who is using McCabe, and why? What values are construed as "acceptable", "requires further investigation", and "this code is rejected"? How were these values derived? Enquiring minds want to know... ------------------------------------------------------------------- | Mark Shanks | | Principal Engineer | All opinions mine, | 777 Displays | of course. | shanks@saifr00.cfsat.honeywell.com | | "We have such sights to show you..." | -------------------------------------------------------------------