This time we dive into std::pin which has a dense documentation. Types that pin data to its location in memory. It is sometimes useful to have objects that are guaranteed to not move, in the sense that their placement in memory does not change, and can thus be relied upon. A prime example of such … Continue reading Rust std study series: Pin
The previous write up seemed to be not sufficient, so I decided to only make this post about resource gathering of articles/talks about C/C++ fundamental issue and Rust and make it easier to follow. Microsoft Security Response Center.C/C++ are impossible to get right.Undefined Behavior pits falls in C abstract machine by John Regehr series of … Continue reading C/C++ vs. Rust
Let's get deep into std::alloc! Memory allocator 101 The very basic need for any program to compile and execute is having access to either physical memory or virtual memory. An allocator is responsible for providing such an access. You can think of an allocator as a service, taking some sort of requests and either giving … Continue reading Rust std study series: alloc
Continuing the standard library study, it's time for Cell<T>! Rust compiler enforces multiple reads access and a single write access mutually exclusive, i.e. either multiple shared references & or one and only one mutable reference & mut. So essentially, Rust prevents the evil of aliasing and mutation between multiple threads. Cell<T> is a sharable mutable … Continue reading Rust std study series: Interior mutability
Every once in a while this topic comes up on a social media or Rust user channel. I'd like to describe briefly the way I see where things are going by a little bit of history as well as some information about existing flux of Machine Learning/Deep Learning frameworks and major recent trends. Brief history … Continue reading State of Machine Learning in Rust
Continuing from Rust standard library study series, it's time for VecDeque<T>. Because of its similarity to Vec, there isn't much to say. A double-ended queue implemented with a growable ring buffer. The "default" usage of this type as a queue is to use push_back to add to the queue, and pop_front to remove from the … Continue reading Rust std study series: VecDeque
Continuing from Rust standard library study series, it's time for LinkedList<T>. Note that implementation are taken from Rust stable v1.33.0. A doubly-linked list with owned nodes. The LinkedList allows pushing and popping elements at either end in constant time. Almost always it is better to use Vec or VecDeque instead of LinkedList. In general, array-based … Continue reading Rust std study series: LinkedList
Recently I've made a presentation about subtyping and variance in Rust for our local Vancouver Rust meetup, but I still think intuition was rather lost in the formalism, so here's my shot at explaining it as intuitively as I can. For more succinct definitions, please checkout the presentation or the resources at the end. First, … Continue reading Variance in Rust: An intuitive explanation
The upcoming series of blog posts will contain my study of Rust standard library. I've partially written some parts of the series in scattered places and want to gather them in one place for better and easier access. I intend to update whenever I discover something interesting/important to remember. I'm referring to implementations in Rust … Continue reading Rust std study series: Vec
This series of posts is going to be a non-traditional intro to Rustlang, so buckle up! I will give more details when necessary. Codes are available in my github. Basic linear algebra such as vector inner product and General Matrix-Matrix (GEMM) product are at the heart of computer science so why not learning Rust by … Continue reading Learn Rust through linalg