Subject: Re: [boost] GSoC idea - interval trees, binary indexed trees, permutation
From: Andrew Sutton (asutton.list_at_[hidden])
Date: 2011-04-02 09:47:01
> While reading Boost documentation, and reviews on XInt, I though about the possibility of implementing for Boost some new data structures that are not yet implemented not even in STL like interval trees, binary indexed trees.
> I also have an other idea about implementing (Boost:Permutation) a Permutation Class that allows operations on permutations.
Sorry I didn't reply to this earlier. The message slipped off my radar.
These seem like interesting data structures, but I'm not sure that
there's a large demand for them. One of the keys to getting a proposal
accepted (for Boost) is to identify mentors that have a specific need
or are interested in a particular problem. I think the XML or JSON
ideas discussed more recently seem to fall into that category.
If that wasn't the case, I'd would be curious to see how this proposal
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk