Tagged: Rust
Post about the programming language rust
Climbing a (binary) Tree
In this post I will show how to transform a recursive depth first traversal function into an iterator for a binary tree
Stacking bits
I will show a very compact (memory efficient) and fast implementation of a binary stack, some Test Driven Design and success types
Prime Time
An introduction to coroutines, typestate machine, phantom types, iterators and ownership issues
Growing a (sorting) tree
In this post we will extend our binary tree using generics and trait constraint, and add a simple sorting algorithm based on depth first traverse.
Polynomials ring
In the previous post I presented a representation of polynomials of a single variable (monovariate) with coefficients in a ring and their evaluation. An important consequence is that multiplicative inverse may not exist. This imply that we can easily implement three traits in rust: Add, Sub and Mult.
Polynomial basics
This post is the first of a series of about polynomials. I'm using it as a mean to explore the rust programming language (especially how generic traits relate to algebra) while also learning math subjects.