On Mon, Jul 6, 2009 at 4:39 PM, Andrew Sutton<
andrew.n.sutton@...> wrote:
> If there is going to be a discussion about adding tree.hh to Boost, then I
> would hope that the discussion focuses on your implementation as a
> standalone data structure, and not as a complete generic library.
> Comparisons of tree.hh to the STL or BGL seem inappropriate to me.
Yes, I think this is what the author means. I think in the old thread
2002 someone misunderstood the library and compared with BGL, which
probably confused many. It is not for graphs but storing and querying
tree-like data. One of the many apps where this data structure is
useful is as a way to store parse results that can later be queried
(e.g. DOM tree)
http://en.wikipedia.org/wiki/K-ary_treeHis implementation of a n-ary tree data structure has been used by a
few apps already and there would be a mutual benefit if it becomes
part of boost
_______________________________________________
Unsubscribe & other changes:
http://lists.boost.org/mailman/listinfo.cgi/boost
