You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
So you're saying to turn the coördinates to offset-binary before encoding them, and then turn them back to one's complement after they're decoded? Hmmmmmmmm… this only entails flipping the most-significant bit, which in turn can be done in one CPU cycle using an XOR. Plus, if we do this after the key has been formed, we could XOR them all at once using a suitable bit-mask.
I guess either of us could do it. Do you have a specific use-case in mind, or are you speaking more generally?
Yeah just in general working with negative coordinates, nothing specific. I am currently using a gist I created instead, due to other issue (performance). Using magic bytes instead of generating them by code appears to create an optimal assembly.
One trick is to pre map this coordinates such that the negative minimum start at 0, 0.
The text was updated successfully, but these errors were encountered: