Re: Bit manipulation

[Jeff Carter <jrcarter@acm.org>]

Redryder wrote:
> 
>  It goes like this: BIT 0 to BIT 31, BIT 31 to BIT 0 ,  and so on.

I take it you want the resulting bit pattern to be the reverse of the
original bit pattern.

This is perhaps best accomplished with packed Boolean arrays, as you can
easily manipulate the individual bits directly, and can change 2 bits
for each value of the loop index.

The fastest but most space-consuming solution would use a look-up table.
Few implementations will support an array of the required size.

You could also use modular types and operations, but this would probably
be less clear than packed Boolean arrays.

-- 
Jeff Carter
"I unclog my nose towards you."
Monty Python & the Holy Grail