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,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,9c86eb13dd395066
X-Google-Attributes: gid103376,public
From: jsa@alexandria (Jon S Anthony)
Subject: Re: CRC in Ada?
Date: 1997/03/04
Message-ID: <JSA.97Mar4182209@alexandria>#1/1
X-Deja-AN: 223319359
Distribution: world
References: <1997Mar2.220652@nova.wright.edu>
Organization: PSI Public Usenet Link
Newsgroups: comp.lang.ada
Date: 1997-03-04T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <331bf6ce.2832564@news.logica.co.uk> garriga@logica.com (Stephen Garriga) writes:

> I had to do an 8 bit CRC a couple of years ago on a DEC Alpha running
> OSF 3.2c & DEC Ada.
> 
>  _IF_ you are doing the CRC on a file (as I was), I would advise you
> to consider performance. I found (exactly the same algorithm)
> implemented in C took an order of magnitude seconds less to execute
> than the Ada equivalent. 

That sounds very odd.  Did you use very different implementation
styles?  For example, maybe use unconstrained types in the Ada or some
such?  In general I would think a similar implementation style here
would yield basically the same "efficiency" result.

/Jon

-- 
Jon Anthony
Organon Motives, Inc.
Belmont, MA 02178
617.484.3383
jsa@organon.com