candidate for bitset

[ma740988]

Given an unsigned int variable that's part of a composite type
struct test {
unsigned int mask;
};

Assume 4 bytes for unsigned int. In one function, I'd like to set
any bit or combination of bits between bits 0 and 23 for the parameter
mask.

So lets suppose I set bits 5, 15 and 23 of mask.

In a separate function I'd like to decode that and store the location
of the bit that was set in a vector .. so in the vector I'd have 5, 15
and 23.

Is this a candidate for bitset? Cant seem to get that to work for me,
then again I'm probably on the wrong track. Trying to determine a way
to make this seemless.

Thanks in advance...

[Victor Bazarov]

ma740988 wrote:

Given an unsigned int variable that's part of a composite type
struct test {
unsigned int mask;
};

Assume 4 bytes for unsigned int. In one function, I'd like to set
any bit or combination of bits between bits 0 and 23 for the parameter
mask.

So lets suppose I set bits 5, 15 and 23 of mask.

In a separate function I'd like to decode that and store the location
of the bit that was set in a vector .. so in the vector I'd have 5, 15
and 23.

Is this a candidate for bitset? Cant seem to get that to work for me,
then again I'm probably on the wrong track. Trying to determine a way
to make this seemless.

Just have fun and implement your own "bitset". What do you think you
can use from std::bitset? 'set' and 'reset'? And std::bitset has no
enumeration, really. So, you'd have to loop over the collection anyway.
Why not challenge your brain to a bit of coding once in a while? :-)

V

[ma740988]

Happy holidays Vic.
|| Why not challenge your brain to a bit of
|| coding once in a while? :-)
Ok