Messages in this thread | | | Subject | Re: [PATCH -mm v2 04/11] rbtree: add helpers to find nearest uncle node | From | Peter Zijlstra <> | Date | Fri, 22 Jun 2012 11:49:40 +0200 |
| |
On Thu, 2012-06-21 at 17:57 -0400, Rik van Riel wrote: > It is useful to search an augmented rbtree based on the augmented > data, ie. not using the sort key as the primary search criterium. > However, we may still need to limit our search to a sub-part of the > whole tree, using the sort key as limiters where we can search. > > In that case, we may need to stop searching in one part of the tree, > and continue the search at the nearest (great-?)uncle node in a particular > direction. > > Add helper functions to find the nearest uncle node.
I don't think we need these at all, in fact, I cannot prove your lookup function is O(log n) at all, since the uncle might not have a suitable max gap size, so you might need to find yet another uncle etc.
| |