Sorry if wrong section / crap name.
I have an index that is encoded as such:
int idx = x << 11 | z << 7 | y;
my question is: can i go from idx back to x, z, y?
If so, how?
If not.. crap.
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Simple Bitwise Encoding and Reversing
Sorry if wrong section / crap name.
I have an index that is encoded as such:
int idx = x << 11 | z << 7 | y;
my question is: can i go from idx back to x, z, y?
If so, how?
If not.. crap.
Related threads:
Re: Simple Bitwise Encoding and Reversing
Yes. Use a paper and pencil to map where the bits in the int are from the original values of x,y,zcan i go from idx back to x, z, y
To extract those values you will need to use a shift to move the bits to the low-order end of the int and an AND operation to 0 out all but the desired bits.
If you don't understand my answer, don't ignore it, ask a question.
Re: Simple Bitwise Encoding and Reversing
You can do it but only if the values of x, y, and z once shifted, fit uniquely in a 32 bit integer without overlap or bit loss.
Regards,
Jim
Reply With Quote