Re: Bitmanipulation in Ada

["Martin Dowie" <martin.dowie@btopenworld.com>]

Bernd Specht wrote:
> Always? What do you think about bitscrambling software which has to
> treat data alternating as bitvector and as integer value in a loop
> like this (not exeactly this for securitity reasons):
>
> ...
> loop
>   declare
>     x : boolean;
>   begin
>      x := b(k);
>      b(k) := b(32 - k);
>      b (32 - k) := x;
>      I := I * prime1 mod prime2;
>   end;
> end loop;
>
>
> Can you find an equivalent algorithm where you can separate the
> bit-ops and the integer-ops?

Sorry, I'm missing something... Are "I" and "b" different views of the same
address space?