Yup, that does it. Fuck Rust.

Yup, that does it. Fuck Rust.

I just tried to write a simple function that takes an integer and returns that integer divided by 3. It failed and then I got back to Python 2.7 and, in 10 minutes, was able to write an equivalent and actually useful function. So fuck you Rust, and your "borrow checker" that took 20 minutes to figure out what to do and then 3 minutes to actually execute. Fuck you, and your promise of "zero runtime". In practice, you have 10x the runtime of a real world program to actually make it perform well. Fuck you. You can't even do the easy stuff right.

What is the point of writing your own programming language if you can't even get the simplest of things right?

  1. 3 weeks ago
    Anonymous

    >getting filtered this hard by trannylang
    The absolute state of pyhtooners

  2. 3 weeks ago
    Anonymous

    This better be bait. How could it take you 10 minutes to write return n/3?

  3. 3 weeks ago
    Anonymous

    works on my machine

    • 3 weeks ago
      Anonymous

      you're missing a return statement there buddy

      • 3 weeks ago
        Anonymous

        why would I include it when it's not necessary?

      • 3 weeks ago
        Anonymous

        Jesus Christ

      • 3 weeks ago
        Anonymous

        retard

      • 3 weeks ago
        Anonymous

        Most knowledgeable rust critic

  4. 3 weeks ago
    Anonymous

    >fuck this retarded zoomer language
    >I'm going back to my other retarded zoomer language

  5. 3 weeks ago
    Anonymous

    >I just tried to write a simple function that takes an integer and returns that integer divided by 3. It failed
    Holy kek. Please for the love of god show us the retarded code you wrote when trying and failing to divide a fucking number.

  6. 3 weeks ago
    Anonymous

    >I got back to Python 2.7 and, in 10 minutes,
    you went too far with the bait there

  7. 3 weeks ago
    Anonymous

    python still probably faster than rust.. sad

    • 3 weeks ago
      Anonymous

      Lolwtf
      I didn't know you could approximate Fibonacci in O(1) with such precision

      • 3 weeks ago
        Anonymous

        Well obviously because the golden ratio is approximated by n/n-1 of the Fibonacci sequence.

      • 3 weeks ago
        Anonymous

        you can do that with any linear recurrence relation. write it down as a matrix, multiply it with itself and compute the limit of that.

      • 3 weeks ago
        Anonymous

        >pow
        >O(1)

    • 3 weeks ago
      Anonymous

      have you taken a look at the compiler output for the C version? I bet you the compiler knew what you were doing >.>

    • 3 weeks ago
      Anonymous

      >comparing the runtime of two different algorithms

  8. 3 weeks ago
    Anonymous

    >in 10 minutes

    • 3 weeks ago
      Anonymous

      Good job quoting one of the several obvious pieces of bait in that post

  9. 3 weeks ago
    Anonymous

    it took you 10 minutes to write
    def divide3(x:int)->int:
    return x//3

    ?

    • 3 weeks ago
      Anonymous

      >no unit test
      >no docstring
      >no comments
      >no entry in the changelog
      sorry, but we can't accept your new feature like this. I'm afraid we have to reject this until you meet our coding standards.

      • 3 weeks ago
        Anonymous

        Those are objectivelt great things. Trying to maintain untested garbage is a nightmare

Your email address will not be published. Required fields are marked *