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.
I am unsure what something like this would be called, (hence the clumsy title) but I need something like this for something I’m working on. I can’t describe it well in words, but I hope this drawing explains for me:
What would be the fastest way of getting the number of "on-bits", "3" in this example, when everything after the arbitrary "index" (5 for example) is to be ignored?
First do
input &= 0xfffffff8(or the equivalent for your input type) to clear the three rightmost bits. Then take your pick from here.