lkml.org 
[lkml]   [2008]   [Nov]   [5]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [RFC] B+Tree library V2
From
Date
On Wed, 2008-11-05 at 21:06 +0100, Jörn Engel wrote:
> 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.

That would be roughly 1/3, no? But it doesn't really matter much.

> > 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. :)

:)
How we going to synchronise this? I'm not in a hurry with this scanning
code and I need to work on it still anyway.

johannes
[unhandled content-type:application/pgp-signature]
\
 
 \ /
  Last update: 2008-11-05 21:15    [W:0.069 / U:1.960 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site