News for hackers. Stuff that matters.
Re:Rust and Go by masklinn on Saturday November 08, 2014 @11:26AM (#8577305)
> I estimate it wouldn't be even two times slower in most of the use cases.

In his "We Need Hardware Traps for Integer Overflow"[0], Regher quotes 5% to 100% overhead for languages such as JS or Racket, and that a "highly tuned" checker would likely be in the 5% range. Playing with arithmetics-heavy programs and Rust's checked_* (which are backed by LLVM's overflow intrinsics[1]) I got anywhere from 5 to 40% performance loss IIRC.

That's not a lot, but at the same time when you're competing with languages specifically not paying those 5%, a 5% hit on all computations is not going to get you much love.

Which is why Rust currently lets you do that (via num::Checked* and num::Saturating) but uses overflowing default semantics.

[0] http://blog.regehr.org/archives/1154

[1] http://llvm.org/docs/LangRef.html#arithmetic-with-overflow-i...

Re:Rust and Go by masklinn on Saturday November 08, 2014 @03:15PM (#8578015)
OTOH I must note that Swift, on the other hand, has opted to error on overflow and have a second set of overflowing operators: https://developer.apple.com/library/mac/documentation/swift/...
Re:Rust and Go by acqq on Monday November 10, 2014 @06:28PM (#8587321)
And that's the best approach I can imagine: programmer should be able to control if he wants 5% penalty or speed. It's a win-win.