> More likely they install a 3rd party generic sum function and don't have to write their own at all. Well, in the case of a sum function it's probably only 15 minutes to write to generic version
I'm not sure "sum over an array of int" is a great "simple" example - how do you guarantee that the result can fit in an int?
This is (one reason) why Julia implemented a full, scheme-style, numeric tower right in the core language.
Sure there are some examples where you can sum N Mbit numbers into an Mbit number, and either want overflow, or is somehow "confident" things will fit. But in general it's just lazy "no one will ever have such a large shopping cart"-design...
What's the result of adding two i32 then? Is it an i64? Doesn't the accumulator need to get wider on some additions, since adding an i64 to an i32 might also overflow an i64?
0 + typemax(UInt8)+ typemax(UInt8)
510
While adding UInt8 first, then an implicit Int64 causes overflow: typemax(UInt8)+ typemax(UInt8)
254
(ie: 255 overflows to 254 - or is promoted and sums to 510)See: https://docs.julialang.org/en/v1/manual/integers-and-floatin...
More likely they install a 3rd party generic sum function and don't have to write their own at all. Well, in the case of a sum function it's probably only 15 minutes to write to generic version, and there may even be one in the standard library. But consider something like a concurrent hash map. In Rust, You just `cargo add dashmap` and you have one that works with any type that works with a regular hashmap. This isn't possible without generics.