[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <1225915040.3619.155.camel@johannes.berg>
Date: Wed, 05 Nov 2008 20:57:20 +0100
From: Johannes Berg <johannes@...solutions.net>
To: Jörn Engel <joern@...fs.org>
Cc: linux-kernel@...r.kernel.org
Subject: Re: [RFC] B+Tree library V2
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
Download attachment "signature.asc" of type "application/pgp-signature" (837 bytes)
Powered by blists - more mailing lists