On 3/26/2011 3:41 PM, Joel Young wrote:
Sitesh Shrivastava<siteshshrivastava<at> gmail.com> writes:
- Templatized General Purpose Tree based data structures and algorithms for them
I think this is a great idea!
I would like to see an abstraction of walks of the trees. So it was very easy to specify left-hand and right-hand walks with left-side, bottom, and right-side visitations.
I'd also like to be able to easily do stuff like perform a right-hand walk on the left child in a binary tree and a left-hand walk on the right child.
What would be even sweeter, is if these same walks could be done on some of the abstract expression trees that are in boost.
<http://svn.boost.org/svn/boost/sandbox/SOC/2006/tree/trunk/> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2101.html> -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org (msn) - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim,yahoo,skype,efnet,gmail