Re: [RFC] B+Tree library V2

[Johannes Berg]

sorry for the late reply.

On Sat, 2008-11-01 at 16:59 +0100, JÃrn Engel wrote:

> Not only compiles, also survives muserspace test harness and no longer
> looks like a bulldog with lipstick.

cool :)

> You might note that "less complicated than expected" means I'm still
> bending the rules a bit.  I only merge underpopulated nodes with
> neighbours.  If the neighbour is too full for a merge I don't steal
> entries.  That bit is for someone else to implement. :)

That sounds fair, after all at least it limits the tree size, but I'm
too lazy to calculate the worst case right now.

I'd use this as-is for the WIP cfg80211 code that keeps track of BSSes,
as a hash-table/list on steroids.

johannes

Attachment: signature.asc
Description: This is a digitally signed message part