This crate is a place where I take notes when learning about a particular data structure or algorithm in Rust, usually by trying to implement a nominal version of the thing myself.
Note that even though the crate is called tinystd, this
does not mean that the crate will not arbitrarily have third-party dependencies in some cases.
Data structures implemented
-
HashMap<K, V> -
RefCell<T> -
Rc<T> -
channel::<T>
Algorithms implemented:
-
Bubblesort -
Insertion sort (naive) -
Insertion sort (using binary search) -
Quicksort
TODO:
- Unit tests for
RefCell - Unit tests for
Rc - Convert unit tests for sorting into better documentation (more literate style)
- Non-threadsafe things? E.g.
ArcorRwLock?
© 2020-2021 Damien Stanton
See LICENSE for details.