IndraDB – A graph database written in Rust

A graph database written in rust. Contribute to indradb/indradb development by creating an account on GitHub. Read more


A zero-overhead linked list in Rust

Let’s implement an immutable, singly-linked list. Singly-linked means that each node contains a reference to the next node, but not vice versa. To make this data structure really performant, let’s use plain references instead of heap-allocated types. This... (more…)

Read more »