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: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: CRC in Ada?
Date: 1997/03/05
Message-ID: <dewar.857612984@merv>#1/1
X-Deja-AN: 223425923
References: <1997Mar2.220652@nova.wright.edu>
 	<331bf6ce.2832564@news.logica.co.uk> <JSA.97Mar4182209@alexandria>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-03-05T00:00:00+00:00
List-Id: <comp.lang.ada>


Jon Anthony asks

<<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.>>

One possibility is that the implementation was relying on doing rotates,
and there certainly is no easy portable efficient way of doing that
in Ada 83 (although for my taste I prefer to use table lookup for
computing CRC's and avoid the bit rotation stuff.