We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
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
for example math_mod(a, 1) a-a/1/1000*1000*1 instead of a-a/1000*1000
math_mod(a, 1)
a-a/1/1000*1000*1
a-a/1000*1000
The text was updated successfully, but these errors were encountered:
This could also be easily expanded to cover multiplication by 0 and addition of 0. Should be pretty easy to do.
Sorry, something went wrong.
Exploid binop identities when optimizing #115
e38deb4
So, I just pushed some changes to develop. Using that new version, you example compiles exactly like you would expect it to.
Released as part of v0.1.11
No branches or pull requests
for example
math_mod(a, 1)
a-a/1/1000*1000*1
instead of
a-a/1000*1000
The text was updated successfully, but these errors were encountered: