As an N=1 sample point, I've programmed in Rust for years now, extensively using generics, and have not once ran into this issue. NP-hardness only shows the wo

As an N=1 sample point, I've programmed in Rust for years now, extensively using generics, and have not once ran into this issue. NP-hardness only shows the worst case is really difficult. It does not mean that an approach is not useful. For example, Rust's exhaustive pattern matching is also technically NP-hard: https://niedzejkob.p4.team/rust-np/ https://niedzejkob.p4.team/rust-np/