GSoC idea - interval trees, binary indexed trees, permutation
Hello, my name is Sebastian Brestin. I am a student from Romania. 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. What do you think?
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.
Hi Brestin, 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 developed. Andrew
Andrew Sutton wrote:
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.
These seem like interesting data structures, but I'm not sure that there's a large demand for them.
Brestin, please have a look at the reviews for Joachim Faulhaber's Interval library. Andrew is right that there is not much demand for interval trees. Personally I would still like to have them, though. Regards, Phil.
Phil Endecott wrote:
Andrew Sutton wrote:
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.
These seem like interesting data structures, but I'm not sure that there's a large demand for them.
Brestin, please have a look at the reviews for Joachim Faulhaber's Interval library. Andrew is right that there is not much demand for interval trees. Personally I would still like to have them, though.
Joachim could mentor the GSOC project and the interval tree could be an enhancement to his library rather than a new boost library. It might be best to reduce the scope to the single data structure. Luke
2011/4/2 Simonson, Lucanus J <lucanus.j.simonson@intel.com>:
Phil Endecott wrote:
Andrew Sutton wrote:
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.
These seem like interesting data structures, but I'm not sure that there's a large demand for them.
Brestin, please have a look at the reviews for Joachim Faulhaber's Interval library. Andrew is right that there is not much demand for interval trees. Personally I would still like to have them, though.
Joachim could mentor the GSOC project and the interval tree could be an enhancement to his library rather than a new boost library. It might be best to reduce the scope to the single data structure.
Hi Sebastian, interval_tree is still on my todo list for Boost.ICL and didn't make it to materialize as real code yet. So an implementation would be a welcome contribution, that is also expected by some boosters ;) I haven't been active as GSoc mentor yet but it would obviously make sense. Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de
participants (5)
-
Andrew Sutton -
Brestin Seby -
Joachim Faulhaber -
Phil Endecott -
Simonson, Lucanus J