-
Notifications
You must be signed in to change notification settings - Fork 8
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.
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
Non-i32 IntCst in solver? #150
Comments
Hi, your assessment is very much correct. There is no fundamental reason why First, it is important to realize that This has the implication that both performance and ergonomics are critical. The As for why 32 bits, the main gain is that a To answer your question. Yes, it may make sense to support i64, i128 or other |
Thanks for the thorough reply! I'm interested in this feature since because I'm trying to use a constraint solver to narrowing integer types in a toy programming language. I know, It's an oddly specific case 😅 |
Hi, apologies for the naive question. Is there any reason (other than performance) for the
IntCst
type to always be i32? Would it make sense to have numbers base oni64
or even arbitrary numbers that have the requirednum-traits
methods?If so, I'd be happy to try tackling the implementation.
Looking into this a bit it seems like the biggest issues are:
int64
right now, so that would also have to be genericas
casts and numeric literals (i.e. assumingIntCst
is a built-in int type)i32
IntCst
isCopy
. I'm not sure the implications if this isn't true (even if all the borrow checker errors are fixed)The text was updated successfully, but these errors were encountered: