• 3 Posts
  • 10 Comments
Joined 7 months ago
cake
Cake day: January 28th, 2025

help-circle
  • Ah, got it—let me clarify a bit.

    Right now, I’m working with arrays and slicing them into smaller segments for indexing. Technically, I could rely on bit manipulation to generate much of this, but I’ve chosen to lean into Rust’s type system for that extra layer of expressive control.

    In Rust, a slice is essentially a fat pointer: it includes both a memory address and a length. Because the slice type encapsulates both, I don’t need to manually track sizes or offsets. Plus, in debug builds, Rust automatically panics if I try to access an out-of-bounds index, which helps catch issues early. And I can use methods like get or get_mut for safe, optional access—either retrieving a value or returning None.

    Ultimately, Rust’s type system saves me from fiddling with raw bit arithmetic and length bookkeeping. It handles validation elegantly, letting me focus on logic instead of low-level guards.

    PS: Although it isn’t finished just yet, I’m linking this Node up with a Buf and Slab struct currently. If i remember when I’ve completed the design and I’m happy to freely distribute the code, I’ll make a paste bin and post it here for you. Always happy to help if I can :)