Boxes and Trees – Smart Pointers in Rust

Recently, I tried to implement a binary tree data structure in Rust.Each binary tree has a root value, a left, and a right subtree.I started from this Python implementation, which is quite straightforward.class Tree: def __init__(self, val, left=None, ri… Read more

Read full article

Similar

Facebook’s next-generation VCS in Rust

mononoke - A Mercurial source control server, specifically designed to support large monorepos. (more…)

Take a break: Rust match has fallthrough

Match + labelled blocks & breaks = fallthrough. It works, but it's not very pretty! (more…)

[Video] Rust Foundation Is Doing What?

The new proposed trademark policy of the rust foundation is absolutely nuts, lets go over ithttps://twitter.com/rust_foundation/status/1644132378858729474###... (more…)

RISC-V OS Using Rust: External Interrupts

This is chapter 5 of a multi-part series on writing a RISC-V OS in Rust. (more…)

A Comparison of Ada and Rust, Using Solutions to the Advent of Code

2023 Advent of Code in Ada. Contribute to johnperry-math/AoC2023 development by creating an account on GitHub. (more…)

Latest News

Roogle: a Rust API search engine

Banray.eu: Raising awareness of the terrible idea that is always-on AI glasses

An AI bot invited me to its party in Manchester. It was a pretty good night