Least expensive way to check each element of an struct array in tick?

That almost makes sense. I figure you mean a hash table that maps all 4 values, and a key that takes the input of all 4 values. But I’m pretty sure this would end up being the same thing, as I would be having to do the same calculations, just with less modularity.

You know, I’m really glad you mentioned Gimbal Locking. I honestly didn’t even know it was a thing, and it now makes as to the limitations of Euler rotations. I guess for that one I’ll have to do more reading on quaternion rotations, which I’ve honestly been putting off for a long time.

So I suppose you did provide some help in the end. Thanks a ton

1 Like