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=-1.3 required=5.0 tests=BAYES_00,MAILING_LIST_MULTI, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,41100a78496a4c71 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-04-04 08:57:03 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!arclight.uoregon.edu!fr.usenet-edu.net!usenet-edu.net!enst!enst.fr!not-for-mail From: =?iso-8859-1?Q?M=E1rio_Amado_Alves?= Newsgroups: comp.lang.ada Subject: RE: Nethack! (was): AdaGames Date: Thu, 4 Apr 2002 17:57:03 +0100 Organization: ENST, France Sender: comp.lang.ada-admin@ada.eu.org Message-ID: Reply-To: comp.lang.ada@ada.eu.org NNTP-Posting-Host: marvin.enst.fr Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Trace: avanie.enst.fr 1017939422 64077 137.194.161.2 (4 Apr 2002 16:57:02 GMT) X-Complaints-To: usenet@enst.fr NNTP-Posting-Date: Thu, 4 Apr 2002 16:57:02 +0000 (UTC) Return-Path: X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook, Build 10.0.2627 Importance: Normal In-Reply-To: <3CAC7AC6.A6DBDC32@despammed.com> X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org X-Mailman-Version: 2.0.8 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: comp.lang.ada mail<->news gateway List-Unsubscribe: , Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org Xref: archiver1.google.com comp.lang.ada:22104 Date: 2002-04-04T17:57:03+01:00 >> I once ran a comparison between raw SLOC, semicolons and Halstead bits >> on a large body of Ada code. The correlation between them was so close >> as to make the method of counting pretty much irrelavent. The secret >> is to pick your > This is true as long as the programmers were not > thinking that there would be any reward or punishment > for a higher or lower count. Take a well-written > module of a reasonable size in any language, and there > are usually ways to greatly change the metric without > changing behavior. You're both right. I also did a study correlating program text metrics and actual development cost in programmers*month. SLOC had the best results, notably beating Halstead. It was a small project (10k SLOCs if I remember correctly), but it was unbiased i.e. the programmers didn't know about the metrics in advance.