reverse bit order
 

Is there any easy way to reverse the order of the bits in a byte in
C++?

(i.e. 00000001 becomes 10000000)

Re: reverse bit order
 

mike7411@gmail.com wrote:
> Is there any easy way to reverse the order of the bits in a byte in
> C++?
>
> (i.e. 00000001 becomes 10000000)

http://www.google.com/search?hl=en&q=reverse+bits+byte

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

Re: reverse bit order
 

mike7411@gmail.com wrote:
> Is there any easy way to reverse the order of the bits in a byte in
> C++?
>
> (i.e. 00000001 becomes 10000000)
>

No. There is only the hard way ;)
You have to shift the bits one by one.
The best idea is to calculate an array
of 256 values that contain the reversed bits.
Then you can "look up" in that array. Here
is the code to make the array (named "BitField"):

int BitField[256];
for (int i = 0; i < 256; i++)
{
int k = i;
BitField[i] = 0;
for (int b = 0; b < 8; b++)
{
BitField[i] <<= 1;
BitField[i] |= k & 1;
k >>= 1;
}
}

If you want safer code, use a vector instead of an array:
vector<int> BitField(256);

Best regards, Martin

P.S. normally, I don't do other people's homework - SCNR this time ;)

Re: reverse bit order
 

Mike posted:

> Is there any easy way to reverse the order of the bits in a byte in
> C++?
>
> (i.e. 00000001 becomes 10000000)


Here's some code I wrote last month. It's written in C, but you'll get the
idea:

http://groups.google.ie/group/comp.l...473fb7f?hl=en&

--

Frederick Gotham

Re: reverse bit order
 

Martin Steen wrote:
>
> int BitField[256];
> for (int i = 0; i < 256; i++)
> {
> int k = i;
> BitField[i] = 0;
> for (int b = 0; b < 8; b++)
> {
> BitField[i] <<= 1;
> BitField[i] |= k & 1;
> k >>= 1;
> }
> }
>
> If you want safer code, use a vector instead of an array:
> vector<int> BitField(256);
>

How is that safer? Either way looks equally correct. If you're worried
about typos, it's far better to use a manifest constant instead of that
hardcoded value of 256.

--

-- Pete

Author of "The Standard C++ Library Extensions: a Tutorial and
Reference." For more information about this book, see
www.petebecker.com/tr1book.

Re: reverse bit order
 

Martin Steen wrote:
> mike7411@gmail.com wrote:
>> Is there any easy way to reverse the order of the bits in a byte in
>> C++?
>>
>> (i.e. 00000001 becomes 10000000)
>>
>
> No. There is only the hard way ;)

If there are only 8 bits in a byte (and nobody said it was the actual
requirement), then a table of 255 values would be the easiest way.

if (mybyte)
mybyte = mytable[mybyte];

Now, generation of the table can be done once, outside of your program.

> [..code not involving a table redacted..]

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

Re: reverse bit order
 

mike7411@gmail.com wrote:
> Is there any easy way to reverse the order of the bits in a byte in
> C++?
>
> (i.e. 00000001 becomes 10000000)
>

The one true way is to recognize that reversing any sequence of bits
involves only splitting it into two parts and returning a value whose
upper half is the reverse of the original lower half and whose lower
half is the reverse of the original upper half. Like this:

#include <limits>
#include <iomanip>
#include <iostream>
using std::numeric_limits;
using std::cout; using std::hex; using std::showbase;
using std::internal; using std::setw;

template <unsigned n> struct reverser_imp
{
static inline unsigned reverse(unsigned val, unsigned mask)
{
mask >>= (n/2);
return reverser_imp<n/2>::reverse((val >> (n/2)) & mask, mask)
| (reverser_imp<n/2>::reverse(val & mask, mask) << (n/2));
}
};

template <> struct reverser_imp<1>
{
static inline unsigned reverse(unsigned val, unsigned)
{
return val;
}
};

inline unsigned reverse(unsigned val)
{
return reverser_imp<numeric_limits<unsigned char>::digits>::
reverse(val, numeric_limits<unsigned char>::max());
}

void show_reversed(unsigned val)
{
cout.fill('0');
cout << hex << showbase << internal;
cout << setw(4) << val << ": "
<< setw(4) << reverse(val) << '\n';
}


int main()
{
show_reversed(0x0f);
show_reversed(0x80);
show_reversed(0x40);
show_reversed(0xC0);
return 0;
}


--

-- Pete

Author of "The Standard C++ Library Extensions: a Tutorial and
Reference." For more information about this book, see
www.petebecker.com/tr1book.

Re: reverse bit order
 

Pete Becker posted:

> inline unsigned reverse(unsigned val)
> {
> return reverser_imp<numeric_limits<unsigned char>::digits>::
> reverse(val, numeric_limits<unsigned char>::max());
> }


In my opinion, it's major overkill to use either of:

numeric_limits<char unsigned>::digits
numeric_limits<char unsigned>::max

The former can be retrieved from:

CHAR_BIT

, while the latter can be retrieved from:

(char unsigned)-1

or even:

UCHAR_MAX

--

Frederick Gotham

Re: reverse bit order
 

Frederick Gotham wrote:
> Pete Becker posted:
>
>> inline unsigned reverse(unsigned val)
>> {
>> return reverser_imp<numeric_limits<unsigned char>::digits>::
>> reverse(val, numeric_limits<unsigned char>::max());
>> }
>
>
> In my opinion, it's major overkill to use either of:
>
> numeric_limits<char unsigned>::digits
> numeric_limits<char unsigned>::max
>
> The former can be retrieved from:
>
> CHAR_BIT
>
> , while the latter can be retrieved from:
>
> (char unsigned)-1
>
> or even:
>
> UCHAR_MAX
>

Haven't you gotten the word? Macros are evil. This is the 21st century.
Quaint C approaches should never be used. Templates, templates,
templates. Always.

--

-- Pete

Author of "The Standard C++ Library Extensions: a Tutorial and
Reference." For more information about this book, see
www.petebecker.com/tr1book.

Re: reverse bit order
 

Pete Becker posted:

> Haven't you gotten the word? Macros are evil. This is the 21st century.
> Quaint C approaches should never be used. Templates, templates,
> templates. Always.

Exceptions, exceptions, exception -- and not the kind you throw!

C++ has many "warts" (if you wish to call them that) which perpetuate from
its origins in C. We have accepted these warts, documented them, and moved
forward.

When you want to give something a name in C++ (be it a function, an object,
a class), then you don't need to pick a very unique name, because all you
need do is enclose it in a namespace:

namespace MyNamespace { int cout; }

Macros muck this up completely. However, there is a finite list of macros
which the Standard defines, such as:

INT_MAX
UCHAR_MAX
CHAR_BIT

As always, the Standard can take liberties wherever it pleases, and it
chooses to define these macros. If you genuinely perfer the numeric_limits
method, then go ahead. However, I myself find it awfully tedious and
longwinded, and I prefer good ol' CHAR_BIT.

While one should hesitate to define macros (for the obvious reasons),
there's no need to hesitate to use the ones that are already there, and
which will _always_ be there. Never will we be able to write:

int CHAR_BIT = 5;

Also, you might notice that "max" and "min" don't evaluate to a compile-
time constant, which make INT_MAX and the like all the more attractive.

--

Frederick Gotham