[rucksack-devel] Btrees

[Edi Weitz]

On Mon, 24 Jul 2006 11:22:16 +0200, Edi Weitz <edi at agharta.de> wrote:

> The attached patch cleans up (at least I hope so) the btree code a
> bit

BTW, you'll notice that I changed your "split downwards" approach to
the usual "split upwards" way which is slightly more efficient.  It
just occurred to me, though, that you might have done this on purpose
to implement (a variant of) the Guibas/Sedgewick algorithm.  But that
would only make sense if you've had plans to implement some kind of
locking for concurrent access, wouldn't it?