Re: How do you bitwise operations in Ada '83 and '95

["Jeffrey R. Carter" <spam.not.jrcarter@acm.not.spam.org>]

jimmaureenrogers@worldnet.att.net wrote:
> 
> I guess that depends upon your definition of bit-wise operations.
> Very few languages support direct indexing of an array of bits.
> The equivalent access operations are a lot of nasty bit masking
> an bit shifting operations.

Indeed. My definition is bitwise and, or, and the like. Accessing 
individual bits is not included (though masking certainly is). I guess 
we should ask for the OP's definition.

However, your example works exactly the same if the array is not packed, 
so the fact that the Boolean values are stored as individual bits is a 
side effect of your desire to save space by packing the array, not a 
need to access individual bits, so I would argue that it is not an 
example of bitwise operations, even if accessing individual bits is 
included in the definition.

-- 
Jeff Carter
"I'm a lumberjack and I'm OK."
Monty Python's Flying Circus
54