Writing time this weekend: an introduction to scientific computing in #rustlang, getting into crates and language features at the same time (hopefully with the right pace). It's geared to people in the Python/R/Julia world who are curious to have a peek at #rustlang.
-
-
-
@jbowayles@ehsanmok Your thoughts would be really appreciated!2 replies 0 retweets 0 likesShow this thread -
Replying to @algo_luca @jbowayles
Good start! This reminded me of a blog post I wrote a year ago https://bit.ly/2SqeAA6 the first thing is how did you micro benchmark? even without bound checking naive Rust is not as fast as Numpy, but ndarray was fastest ...
1 reply 1 retweet 1 like -
If you didn't use cargo benchmark (black box) or criterion crate, most probably the Rust result is wrong. If done in a simple loop, the compiler sees it's the same thing and won't compute it again. #![feature(test)] or criterion handle that.
2 replies 0 retweets 0 likes -
Despite I did it with small f32, I guess the results shouldn't change that much (it's possible Rust has got better!). Btw, Rust has a "return" keyword . I wasn't expecting to see bubblesort at the end :)
2 replies 0 retweets 0 likes
Bubblesort is a cool thing to showcase that Rust's loops are fast - something you simply can't do with a self-contained solution in a high-level language.
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.
Writing about stuff to learn how it works, mostly in Rust.
Lead Engineer at