5 commits

Author	SHA1	Message	Date
Jason Evans	15f8d49756	Rewrite red-black trees to do lazy balance fixup. This improves ... insert/remove speed by ~30%.	2010-02-28 22:57:13 +00:00
Jason Evans	2e78350530	Clean up cpp logic and comments.	2008-05-14 18:33:13 +00:00
Jason Evans	4788234366	Fix a comment.	2008-05-03 17:49:16 +00:00
Jason Evans	21162484ae	Add rb_wrap(), which creates C function wrappers for most rb_*() ... macros. Add rb_foreach_next() and rb_foreach_reverse_prev(), which make it possible to re-synchronize tree iteration after the tree has been modified. Rename rb_tree_new() to rb_new().	2008-05-01 17:24:37 +00:00
Jason Evans	e5bf0d71c9	Implement red-black trees without using parent pointers, and store the ... color bit in the least significant bit of the right child pointer, in order to reduce red-black tree linkage overhead by ~2X as compared to sys/tree.h. Use the new red-black tree implementation in malloc, which drops memory usage by ~0.5 or ~1%, for 32- and 64-bit systems, respectively.	2008-04-23 16:09:18 +00:00