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. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@xxxxxxxxx. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href