Lookup time #21
Description
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.