Re: [boost] [tree] Reviving the tree library (was: inquiry about proposing a new Boost library for a tree template container class)

Subject: Re: [boost] [tree] Reviving the tree library (was: inquiry about proposing a new Boost library for a tree template container class)
From: Jeffrey Lee Hellrung, Jr. (jeffrey.hellrung_at_[hidden])
Date: 2011-05-04 18:46:39

On Wed, May 4, 2011 at 3:17 PM, Rene Rivera <grafikrobot_at_[hidden]> wrote:

> On 5/4/2011 4:37 PM, Cromwell Enage wrote:
>
>> --- On Wed, 5/4/11, Vicente Botet wrote:
>>
>>> Erik Erlandson wrote:
>>>
>>>>
>>>> Hello,
>>>>
>>>> I recently completed an STL-compliant template
>>>> container class for storing data in an arbitrary
>>>> tree structure.  It seemed like it might be a
>>>> useful component of Boost, and I wanted to ask
>>>> about how new projects are submitted for
>>>> consideration.
>>>>
>>>> The current incarnation of the project is called
>>>> 'st_tree', and resides here:
>>>> https://github.com/erikerlandson/st_tree/wiki
>>>>
>>>>
>> [snip]
>>
>>  I think that Boost.Tree is orphaned so maybe you
>>> could see how to make a better libraries from both.
>>>
>>
>> It's orphaned!?  Shoot, I'd like to help out with this too...maybe merge
>> my TreeNode stuff if possible.
>>
>
> It looks like Bernhard stopped development 1.5 years ago. Which sure sounds
> like it's orphaned. Given that I've copied it over to sandbox/tree location
> (the last trunk state for it). I'm willing to help out in moving the library
> forward, especially since it's based on some of the core concepts I
> suggested. Who else is willing to help out in improving and finishing this
> lib? Note, that helping out involves thinking about adjusting the TR
> proposal so that it can be submitted for the soon to start up again TR2.
>

I could maybe help.  I developed some general binary search tree, red-black
tree, and avl tree algorithms not too long ago, both recursive and
non-recursive variants (where applicable) and all policy-based.  I had a
need for the algorithms to be separated from the data structures since the
comparison function could be supplied dynamically, hence needn't (and
probably couldn't) be maintained by the data structure.  And I thought it
would be a fun exercise.

I will take a look at these other tree data structures in the near future...

- Jeff