Tag Archives: b-tree

Wrap-up

Hello, all.  Yes, I’m still sick.  Yes, I totally fsck’d over my Linux partition.  No, I don’t currently have Rust installed.  No, I have not yet made a new pull request with my recent and totally awesome changes.  I’ve just … Continue reading

Posted in Uncategorized | Tagged , , , , | Leave a comment

Now for the fun stuff: the add method for btree.rs

It’s about time I started on something exciting!  It’s time to implement the add method in my btree library. Here’s how it works: Find the appropriate leaf node in which to add the new key-value pair by searching down the … Continue reading

Posted in Uncategorized | Tagged , , , , | Leave a comment

Back to Intro CS: the Perks of Recursively-Defined Data Structures

I chose to work on the B-tree library because it sounded a lot like the projects I used to work on in my freshman-year intro computer science class.  And it is, in a way: I’m using a recursively-defined data structure … Continue reading

Posted in Uncategorized | Tagged , , , , | Leave a comment