|
Boost : |
Subject: Re: [boost] GSoC idea - interval trees, ITL tie in
From: Simonson, Lucanus J (lucanus.j.simonson_at_[hidden])
Date: 2011-04-02 14:07:41
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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk