Boost logo

Boost :

Subject: Re: [boost] GSoC'11 [Own Idea] -Mentor Needed
From: Joel Young (jdy_at_[hidden])
Date: 2011-03-26 16:41:29


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.

Joel


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk