tech-kern archive

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]

Red-black tree optimisation



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

Kind regards,
Adam


Attachment: Tree.pdf
Description: Adobe PDF document

Attachment: tree.pch
Description: Binary data



Home | Main Index | Thread Index | Old Index