Learning new things!
both Rust and C++ basically give you two big “map families”:
BTreeMap (Rust) and std::map (C++) are not arrays.
They are balanced trees (B-tree …
Rule:
First In → First Out
append back, pop from front
Like people waiting for coffee.
enter: A B C D leave: A B C D
Operations:
enqueue (add at back) dequeue (remove from front)
Use:
VecDeque
use std::collections::VecDeque; let mut q
The architects are to convert a vague business need → technical system structure.
The process has 6 phases:
Architects don’t start with …
What can you learn from this piece of code?
Send: a value of this type can be moved to another thread safely.
Sync: a value of this type can be shared between threads by reference safely.
Formally: T: Sync means &T: Send.
A …
Parallelism in Rust usually means one of three things:
When making things go parallel, there are following things to consider. Safe parallel code comes from being …
A procedural macro is Rust code that runs at compile time and generates Rust code by programmatically transforming syntax trees.
Normal Rust code runs at runtime
Procedural macros run while the compiler is compiling
Classic examples:
An interpreter is a program that executes another program directly, instruction …
Every value in Rust has exactly one owner at a time, and when the owner goes away, the value is automatically cleaned up.
Let’s build this step by step.
Rust enforces these at compile time:
What it is
T: Trait, impl Trait)How it works
explanation for this equation:
\(\underbrace{p(r_1, …, r_i, x’)}_{x’\in\{0,1\}^{i-l}}= \sum\limits_{y\in \{0,1\}^l}\widetilde{eq}(r_1, …, r_i, x’,y)\cdot p(y)\)
\(=\sum\limits_{y\in \{0,1\}^l}\underbrace{\widetilde{eq}(r_1, …, r_i, y)}_{y\in \{0,1\}^{i}}\underbrace{\widetilde{eq}(x’,y)}_{y\in \{0,1\}^{l-i}}\cdot \underbrace{p(y)}_{y\in \{0,1\}^l}\)
\(=\sum\limits_{y\in \{0,1\}^i}\underbrace{\widetilde{eq}(r_1, …, r_i, y)}_{y\in \{0,1\}^{i}}\underbrace{\cdot p(y, x’)}_{y\in \{0,1\}^{i}}\)
…