Subject: Re: [boost] GSoC idea - interval trees, binary indexed trees, permutation
From: Phil Endecott (spam_from_boost_dev_at_[hidden])
Date: 2011-04-02 12:18:34
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk