[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20081105200635.GE6561@logfs.org>
Date: Wed, 5 Nov 2008 21:06:35 +0100
From: Jörn Engel <joern@...fs.org>
To: Johannes Berg <johannes@...solutions.net>
Cc: linux-kernel@...r.kernel.org
Subject: Re: [RFC] B+Tree library V2
On Wed, 5 November 2008 20:57:20 +0100, Johannes Berg wrote:
>
> That sounds fair, after all at least it limits the tree size, but I'm
> too lazy to calculate the worst case right now.
Worst case you have a single entry next to a full node, then split the
full node, etc. So slightly more than 1/4 populated.
> I'd use this as-is for the WIP cfg80211 code that keeps track of BSSes,
> as a hash-table/list on steroids.
Excellent. With this trojan horse in place I don't have to worry much
about a competing library with a different interface. Famous last
words. :)
Jörn
--
The wise man seeks everything in himself; the ignorant man tries to get
everything from somebody else.
-- unknown
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists