Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What is the most efficient way to compare a flag (0x00010001) bitwise with an integer and see if both the bit in integer is set ?
In other words what is the most efficient way to perform following ?
bit = (number & 0x001 ) & (number 0x 0x00010000 )
I’d go with
which will be true if and only if both bits in
numberare set.