Menu
I have a very simple question: In C++, is there an in-built or straightforward way to group a large (~1000) number of bits (or bools) in a single label such that the inbuilt bit operators function as they do for fundamentals?
e.g. for a long you might write:
unsigned long maximum = ~0;
or one might use:
somenum>>;
Is there an analogous way to do this for a block of memory of arbitrary size?
If not, what are some good alternatives ? I have thought of bit <vectors>, a C union, etc., but these all seem to require handwritten routines for the various bit operations.
200
asked Aug 27 '12 20:08
Because they allow greater precision and require fewer resources, bitwise operators can make some code faster and more efficient. Examples of uses of bitwise operations include encryption, compression, graphics, communications over ports/sockets, embedded systems programming and finite state machines.
Bit shift operators These operators shift bit sequences to the left or right by a number of spaces, padding with 0 bits and dropping any bits that fall off the number. Here are some examples. unsigned char x = 0xD5; // 11100101 x = x << 2; // x is now 10010100 x = x >> 3; // x is now 00010010.
For example, this is necessary to change settings in the microcontroller or other devices. We use bitwise operators to change certain bits while not affecting others.
Yep! It's called std::bitset and does just that.
Hope this helps!
148
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
