[lkml]   [2008]   [Nov]   [5]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [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. :)


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
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2008-11-05 21:09    [W:0.114 / U:1.292 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site