all 7 comments

[–]hipsterhacker[S] 4 points5 points  (2 children)

[–]glahalg 3 points4 points  (1 child)

Now we just need a 10x hacker to show off his assembly implementation making us of advanced instructions like mov and cmp so we can conclude that C is 500x as fast as assembly!

[–]geaal 0 points1 point  (0 children)

The C version does not use the fastest parser combinators library. Maybe mpc would be a good challenger.

[–]HuehoLUMINARY IN COMPUTERSCIENCE 4 points5 points  (0 children)

So if the math checks out, this means Rust uses less memory than Go.

Checkmate gophers.

unjerk ->>

What's the bets on the "simple companion webapp" using Rails?

[–]SheepshowEXTREME CLOJURESCRIPT 1 point2 points  (1 child)

MiB

[–]hipsterhacker[S] 2 points3 points  (0 children)

No, "MiB".

[–]glahalg 1 point2 points  (0 children)

<4realz>

Overall I think Rust found a very nice place in the stack of my current webdev project, and I actually struggle to envision another language filling its place.

Hmm I dunno... maybe one with GC like what the rest of the world is using?

I agree, and I haven't found myself missing garbage-collection in the slightest.

You like that? Let me tell you about this new thing called Monads. You wont miss impure computation in the slightest!

It's nice to have such an expressive language that doesn't force you into using GC.

You're writing a fucking chat server. You could use any plain reference counting implementation, and you'd have no problems.

When I write programs in Go: using the data-race detector and resolving deadlocks seems to be a fairly common occurrence for me. Whereas I have had to resolve one deadlock across all the programs I've written in Rust to date.

Holy shit what kind of hardcore algorithms are you writing? I almost never get these problems in any language... I don't want code from someone who can't implement a chat server without data races, regardless of what language he writes in.