Re: Any examples of Byte Ordering Functions

["(see below)" <yaldnifb@blueyonder.co.uk>]

On 19/10/03 16:22, in article
ZUxkb.3653$KA5.30672@newsfep4-glfd.server.ntli.net, "chris"
<spamoff.danx@ntlworld.com> wrote:


> Trivial? :(  Can you tell me how to do it pls?
> 
> I have the following:
> 
> type byte is mod 256;
> type word is mod 2**16;
> type dword is mod 2**32;
> 
> for byte'size use 8;
> for word'size use 16;
> for dword'size use 32;
> 
> 
> I can do stream -> word and back using multiplication/division for big
> and little endian, but not dword.


You can use shifts, ands (for masking) and ors (for combining) bit patterns
in unsigned types as easily in Ada as in C. (gasp!) No need to rely on the
compiler sussing out your arithmetic.

-- 
Bill

P.S. Actually, it's better than C! As well as logical shifts, you have
circular (rotate) and arithmetic (sign-aware) shifts in Ada.