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

Perf: optimize the implementation of bittest operations #4391

Open

crusso opened this issue Feb 9, 2024 · 0 comments

Contributor

crusso commented Feb 9, 2024

The primitives could directly return booleans, rather than requiring the additional inequality test against 0 in prim.mo.

This would be more efficient and would ensure the Prim.bittest operations are inlined (they are not at the moment, unlike most other prims).

crusso assigned crusso and unassigned crusso

crusso mentioned this issue

feat: precise tagging of scalar values #4369

Merged

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