implemented one of the remu3 from hacker's delight for practice, of course, rustc does this for us already (as do most other compilers). #rustlangpic.twitter.com/1TiOktb6fS
-
Not following... raindrops exercise from exercism.io is a fizzbuzz problem. It's remainder of 3, 5 and/or 7 (non-2^n constant in HD). This would be optimized away in real code too, as this is an optimization the compiler performs. Benches are for fun, as is looking as --emit asm.
You're literally benchmarking an empty function. You're never using the result of your rem calls, so the compiler optimizes it away. You need to return the value or use `test::black_box`.
-
-
https://gist.github.com/sgrif/979b36a145c93a5c6cc67296dc4f0a49 … will actually benchmark the functions for an unknown value of `n` (and you'll see that the builtin mod3 is faster than remu3)
-
that's awesome. thanks. Still have a lot to learn. Here's a test run with your functions, also an attempt to introduce some randomness as well. Results still look the same - thoughts?pic.twitter.com/S17MlwdmPQ
- 5 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.