[Bug 1641] Red Black Tree data structure

[bugzilla-daemon at rtems.org]

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

--- Comment #17 from Chris Johns <chrisj at rtems.org> 2010-11-24 19:12:11 CST ---
(In reply to comment #16)
> The advantage of adding a generic balanced search tree to the score is that in
> theory it can be used in multiple locations.  The AVL tree of the bdbuf is
> embedded in the structure pretty tightly, so that the code and structure cannot
> be easily re-used.

If the code can be shared we can lower the bdbuf foot print.

> In contrast, it should be easy to adapt the bdbuf to use the red-black tree
> structure, although the cost-benefit should be thoroughly explored.

Yeap we should take a closer look. If it is close then a full tested tree is
much better because increases our coverage when including the file system.

> Chris suggested that we might support both an integer and a string.  We should
> capture the set of requirements for the tree's search parameter for whichever
> core services it might support.  

Without something like template support we should have a couple of keys that we
support. I assume for an int key performance is important. For the string key
performance is not so important.

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