Re: Using representation clauses in networking software

["Yannick Duchêne (Hibou57)" <yannick_duchene@yahoo.fr>]

Le Sun, 15 Aug 2010 16:32:47 +0200, Dmitry A. Kazakov  
<mailbox@dmitry-kazakov.de> a écrit:
> Byte ordering is what S'Bit_Ordering is, when bytes are addressable.
Do you mean when byte and bit are the same ? I am sure to understand

Or else may be I should go back and read again the 'Bit_Order attribute  
specification.


>> Just to try to meet your request (something else later) : I do not know  
>> a
>> way to have a method which would automatically know the bit order of its
>> platform,
>
> Bit order is useless if bits are not directly addressable.

I wrote bit ordered where I meant byte ordering (clumsy mistake of mine)


-- 
There is even better than a pragma Assert: a SPARK --# check.
--# check C and WhoKnowWhat and YouKnowWho;
--# assert Ada;
--  i.e. forget about previous premises which leads to conclusion
--  and start with new conclusion as premise.