Bitfield mask/operations with optional items

Posted by user1560249 on Stack Overflow See other posts from Stack Overflow or by user1560249
Published on 2014-08-22T21:09:26Z Indexed on 2014/08/22 22:20 UTC
Read the original article Hit count: 221

Filed under:

bit-manipulation

|

bit-fields

|

bitmask

|

bit-fiddling

I'm trying to find a way to handle several bitfield cases that include optional, required, and not allowed positions.

yy?nnn?y
11000001

?yyy?nnn
01110000

nn?yyy?n
00011100

?nnn?yyy
00000111

In these four cases, the ? indicates that the bit can be either 1 or 0 while y indicates a 1 is required and n indicates that a 0 is required. The bits to the left/right of the required bits can be anything and the remaining bits must be 0. Is there a masking method I can use to test if an input bit set satisfies one of these cases?

© Stack Overflow or respective owner

Related posts about bit-manipulation

Find three numbers appeared only once using bit manipulation

as seen on Stack Overflow - Search for 'Stack Overflow'
In a sequence of length n, where n=2k+3, that is there are k unique numbers appeared twice, how to find the three unique numbers that appeared only once using bit manipulation? for example, in sequence 1 1 2 6 3 6 5 7 7 the three unique numbers are 2 3 5. >>> More
Learning C bit manipulation

as seen on Stack Overflow - Search for 'Stack Overflow'
I didn't know any better name for a title of the question. For ex: on one of my previous questions one answered ((a)-(b))&0x80000000) 31 - this is kind of a too advanced for me and i can't really get what it means. I am not looking just for an answer of that, but i need someone to tell me some… >>> More
Bit manipulation, permutate bits

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi. I am trying to make a loop that loops through all different integers where exactly 10 of the last 40 bits are set high, the rest set low. The reason is that I have a map with 40 different values, and I want to sum all different ways ten of these values can be multiplied. (This is just out of… >>> More
bit manipulation in java

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a fragment of bytes in a byte[]. The total size of the array is 4 and I want to convert this into a positive long number. For example if the byte array is having four bytes 101, 110, 10, 1 then i want to get the long number represented by binary sequence 00000000 00000000 00000000 00000000… >>> More
Doing 64 bit manipulation using 32 bit data in Fixed point arithmetic using C.

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I am stuck with a problem. I am working on a hardware which only does support 32 bit operations. sizeof(int64_t) is 4. Sizeof(int) is 4. and I am porting an application which assumes size of int64_t to be 8 bytes. The problem is it has this macro BIG_MULL(a,b) ( (int64_t)(a) *… >>> More

Related posts about bit-fields

How slow are bit fields in C++

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a C++ application that includes a number of structures with manually controlled bit fields, something like #define FLAG1 0x0001 #define FLAG2 0x0002 #define FLAG3 0x0004 class MyClass { ' ' unsigned Flags; int IsFlag1Set() { return Flags & FLAG1; } void SetFlag1Set()… >>> More
Can we represent bit fields in JSON/BSON?

as seen on Stack Overflow - Search for 'Stack Overflow'
We have a dozen simulators talking to each other on UDP. The interface definition is managed in a database. The simulators are written using different languages; mostly C++, some in Java and C#. Currently, when systems engineer makes changes in the interface definition database, simulator developers… >>> More
Bit fields in C ?

as seen on Stack Overflow - Search for 'Stack Overflow'
HI all, Is there anyway by which we can declare variable specifying bit fields on those which are not any members of structures or unions.If not,then is there anyway by which we can just declare a variable by specifying the number of bits it is permitted to use. Thanks maddy >>> More
Data structures with different sized bit fields...

as seen on Stack Overflow - Search for 'Stack Overflow'
If I have a requirement to create a data structure that has the following fields: 16-bit Size field 3-bit Version field 1-bit CRC field How would I code this struct? I know the Size field would be an unsigned short type, but what about the other two fields? >>> More
C++ Unions bit fields task

as seen on Stack Overflow - Search for 'Stack Overflow'
Can somebody clear me out why would I use union and with what purpose the same address for the cin'ed variable and bit field (task from the Schildts C++ book)? In other words why would I use union for : char ch; struct byte bit; // Display the ASCII code in binary for characters. #include… >>> More