Hi, On Tue May 04 2010 at 18:20:30 +0200, Adam Ciarci?ski wrote: > Hello, > > Because at one point I studied red-black trees (not as in dendrology, > but as data structures), I looked into the implementation that is > being used in NetBSD. I have made some drastic optimisations on sys/ > sys/tree.h and would like to have the changes imported into NetBSD > repository. > > I would like someone to take a look at the patch, which is attached to > this message, and verify the code. I have also attached a short PDF > document, in which I comment on changes made to the implementation of > the red-black tree algorithm. > > If it's okay, I can commit the changes myself. > > I think we all will benefit from faster and smaller code. :)
Can you present numbers to support your claims of drastic optimizations? I've used tree.h in out-of-NetBSD projects and don't mind this being committed. However, I did not review your changes, so I hope you have made 100% sure there are no regressions. Remember that usually the only way to win is not to play at all ;)
