Subject: Re: [boost] [tree?] STL like tree data structure in boost?
From: Jeff Flinn (TriumphSprint2000_at_[hidden])
Date: 2009-11-03 08:33:43
Nil Geisweiller wrote:
> any idea if there is in boost a similar tree data structure such as
> Kasper Peeters's tree.hh http://tree.phi-sci.com/ ?
Dan Marsden presented a Traversal Library at boostcon 2008 that IMHO
would replace the need for an explicit tree data structure. It's based
on the "Scrap Your Boiler Plate" paper that recognizes that most
programs already possess tree-like structure and more generally have
"data structures built from rich mutually-recursive data types". It's
intent is to abstract out the generic traversal mechanics allowing the
programmer to focus on the "reason for traversal".
I'm not sure where this library stands, or if Dan has continued development.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk