|
Boost : |
From: Bernhard Reiter (ockham_at_[hidden])
Date: 2008-02-17 16:06:34
Am Samstag, den 16.02.2008, 13:18 -0200 schrieb Felipe Magno de Almeida:
> I remember there was a boost.tree SoC proposal. Did it got through?
> What is the status of this library?
>
> I would like to use it as a concept for a GUI tree view control I'm creating.
As I've curiously received a similar request just about two weeks ago,
I'll forward my reply to it:
> > Berhard / Rene,
> >
> > I'm very interested in the generic tree implementation that you're
> > developing for boost.
> >
> >
> http://svn.boost.org/trac/boost/browser/sandbox/SOC/2006/tree/trunk/libs/tree/doc/html/proposal.html
>
> Nice to hear that, as there hasn't been too much interest and feedback
> from outside of Boost yet...
>
> > However, I'm noticing that the last changes were made to the code
> about
> > 4-6 months ago, so does this mean that :
> >
> > a) It's pretty much done and ready to use ? Or
> >
> > b) You've run into some problems and/or gotten tired of it, and
> therefore
> > have abandonned it ? Or
> >
> > c) You simply haven't had time to work on it ?
>
> c). There might be a couple of concrete issues with the
> implementation,
> as well as a couple of minor flaws, but the main issue is that I'm
> lacking time (due to university exams that is atm) that I would need
> to
> look into the design and code; there's quite a couple of things
> drafted
> in the proposal that just aren't implemented yet (and a couple that
> I'd
> actually do differently from how they're described there).
>
> Since I last worked on the proposal, my attention regarding the design
> has somewhat shifted from implementing (text-book examples of)
> self-balancing binary search trees (as a first proof of concept)
> towards
> actual algorithms using cursors, ultimately aiming at a reasonable
> collection of such algorithms and a first implementation of a
> forest_tree to use them on.
>
> I'm still strongly interested in finishing this project one day, but
> from a realistic perspective, I can't really promise when that day
> will
> be. I might however have some more time to work on it after February.
>
> > If the answer c, what would you say that the level of completion
> is ? Are
> > there still major holes, or does it just need a few finishing
> touches ?
>
> I'm afraid there are still holes, their size depending on what aspect
> of
> trees you need most, be it SBBST, "generic"/forest trees or whatever
> else...
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk