[Bug 1641] Red Black Tree data structure

bugzilla-daemon at rtems.org bugzilla-daemon at rtems.org
Thu Jul 29 13:55:40 UTC 2010


--- Comment #6 from Gedare <giddyup44 at yahoo.com> 2010-07-29 08:55:39 CDT ---
(In reply to comment #5)
> For the Bdbuf we use AVL-trees.  Why do we need both tree (AVL and red black)
> algorithms?  Can we discard one and share code?

My understanding of the requirements of code in score is that it should be
self-contained. So I re-wrote a balanced binary search tree, and chose
red-black because it seems appropriate for tracking ready tasks.  I was unaware
of any fully self-contained balanced search tree implementations under the
RTEMS license.  I would be OK with switching to one or the other, although
switching to AVL will delay my gsoc.


Configure bugmail: https://www.rtems.org/bugzilla/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are watching all bug changes.

More information about the bugs mailing list