[Bug 1641] Red Black Tree data structure

[bugzilla-daemon at rtems.org]

https://www.rtems.org/bugzilla/show_bug.cgi?id=1641

--- Comment #9 from Gedare <giddyup44 at yahoo.com> 2010-07-30 11:04:02 CDT ---

> > I suspect we may need a bake-off between them to decide which the cache uses so
> > I am happy to wait until the other GSoC work is finished. Is the use of the
> > tree abstracted in the score ?
> It is not abstracted right now, although the code points that are introduced
> aren't too hard to re-write, it would depend on how different the AVL node is
> compared to the rbtree node.

Maybe I misunderstood: the accessors to the red-black tree are abstract, in the
sense that there is an interface to access the tree, and only the Red-Black
Tree code updates the node pointers etc.  There could stand to be maybe a few
more functions added, for example to update node values.  However, the tree is
encapsulated similarly to how RTEMS Chains are structured. In fact, I copied
the chain code originally to set up the RBTree code infrastructure.

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