Відео

In this session, we change our implementation to read Hanoi's B-Tree levels using file handles and seeking instead of loading the entire data file into RAM at the beginning.

Continuing our implementation of HanoiDB in Rust, with help from a special guest Greg Burd! We first run a longer populating script and try out the merge visualizer, then fix some problems with our initial implementation and start iterating over the entries within blocks of a single file. Repo: github.com/seancribbs/hanoidb-rs Reference implementation: github.com/krestenkrab/hanoidb

This is a new series looking at HanoiDB, an interesting indexed key-value storage engine that was originally built for Riak. We start by getting the ancient code running on a more recent Erlang/OTP version, then write out some data to disk and try to read it back from a new Rust crate.

We return to our implementation of Berkeley DB and figure out the flaws in our single-key lookup algorithm, and then start implementing it in Elixir.

We continue following the blog post series "Building BerkeleyDB" ( transactional.blog/building-berkeleydb/ ), completing the task of walking all key-value pairs in the database and start implementing "point reads", i.e. fetching a single value for a given key.

We continue our implementation of Berkeley DB, refactoring a lot of the manual code into a better structure and try to complete the task of the second post in the series walking the btree from first key to the last key.

Implementing Berkeley DB, Session 1: Page and Entry formats

Bevy Survivors - Session 17: Adding Start and Game Over Screens

Bevy Survivors - Session 16: Spawning Enemies from Data

Bevy Survivors - Session 15: Generalized Weapon Spawns

Bevy Survivors - Session 14: Health Bars and Damage Ticks

Bevy Survivors - Session 13: Sprite sheets and Generalized Enemy Definitions

Bevy Survivors - Session 12: Spawning enemies inside the level

Bevy Survivors - Session 11: Fixing Wall Collisions

Bevy Survivors - Session 10: Refactoring Collision Systems

Bevy Survivors - Session 9: Integrating LDTK better

Bevy Survivors - Session 8: Doing the Bevy/LDTK tutorial

Bevy Survivors - Session 7: Collision events and Level-editing with LDTK

wasm-bindgen patch and Bevy Survivors - Session 6: Improving wall collisions

Bevy Survivors - Session 5: Map bounds and Walls

Patching wasm-bindgen to handle third-party macros

Bevy Survivors: Session 4 - Systems Schedules, Knock-Back, Weapons, and more!

Bevy Survivors: Session 3 - Collisions and HP

Bevy Survivors: Session 2 - Adding a player and enemies giving chase

Hodge-podge session: Hardhat release, Tree-Sitter Error Handling, and Getting started with Bevy

Elixir NIFs to TreeSitter - session 6: Multi-language Parsers / BONUS: Hardhat 1.0 Release

Elixir NIFs to Tree-Sitter, session 5: Reusing Parse Trees through Edits

Elixir NIFs to Tree-Sitter, session 4: Walking the Tree

Elixir NIFs to Tree-Sitter, session 3: Working Queries