New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Lookup time #21

Open

th0ma5w opened this issue Jul 14, 2023 · 0 comments

th0ma5w commented Jul 14, 2023

I am probably saying the same thing as other just I don't have the proper terms probably but to save on lookup time:

Take the binary representation of every transformation and sum them, and that becomes the object hash.

When evaluating a new object do the same and that hash should match any rotation with just one match lookup?

Probably a way to make a tree of these as well but I imagine the hashing is effectively doing that anyway.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment