Hacker News Reader

We'd like that too; it's likely to fall out of const generics, which are looking likely to hit stable sometime early next year.

With const generics ranged integers would be implemented as a user specified check.

How viable would it be to implement an optimization step which seeks to minimize the number of these checks?

I'm not entirely sure what you mean, exactly. As far as I know, all of the usual optimization passes would already be working to minimize them.

Rust could emit LLVM range metadata for ranged integers. IIRC, it already does so for enum discriminants.

That seems quite good!

That's probably down the line from const generics, as it has the additional constraint of defining the workings of those (API, over/underflow behaviour), how they'd interact with regular integral types (in terms of conversions back and forth), literals, …

That would be awesome, especially if it works similarly to Ada.