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
After having done some experiments to see when these lookup tables may be beneficial for performance, I haven't really found much. What I did find is that if the compiler can inline a function and / or use conditional move instead of conditional jump, chances are it'll be much faster than using a lookup table: https://godbolt.org/z/ndo6jqbWr
I'd like to request some minimal examples where these lookup tables are measurably faster than code without them, if possible.
The text was updated successfully, but these errors were encountered:
After having done some experiments to see when these lookup tables may be beneficial for performance, I haven't really found much. What I did find is that if the compiler can inline a function and / or use conditional move instead of conditional jump, chances are it'll be much faster than using a lookup table: https://godbolt.org/z/ndo6jqbWr
I'd like to request some minimal examples where these lookup tables are measurably faster than code without them, if possible.
The text was updated successfully, but these errors were encountered: