Subject: Re: [boost] Interval Trees & ICL
From: Dave Abrahams (dave_at_[hidden])
Date: 2010-12-15 13:28:26
On Wed, Dec 15, 2010 at 12:49 PM, Joachim Faulhaber
>> The two main candidates would be something like to boost::split_interval_set or
>> a centred interval tree
>> (along the lines of http://en.wikipedia.org/wiki/Interval_tree).
>> It seems to me that the characteristics of an interval tree differ sufficiently
>> from the containers defined in ICL that they might make a useful addition.
> No doubt, interval_trees would be a useful addition to the library.
> For certain use cases they perform better than the interval container
> currently available in the ICL.
In the cases where I've needed them, only a container that preserved
the inserted intervals (and information about overlaps) would do (I
was storing musical notes, FWIW)
-- Dave Abrahams BoostPro Computing http://www.boostpro.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk