Subject: Re: [boost] ICL space and running complexity
From: Phil Endecott (spam_from_boost_dev_at_[hidden])
Date: 2014-09-10 20:12:32
Kenneth Adam Miller <kennethadammiller_at_[hidden]> wrote:
> With regards to the ICL data structure, can anybody tell me what the space
> and time complexity is of the various interval_map types (split and
It's not as good as it could be, if it used an interval tree.
You'll find discussion of this if you search for the library's
review in the mailing list archive.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk