bert hubert 🇺🇦🇪🇺🇺🇦Does anyone know of a performant, well-tested C++ implementation of an interval tree that you can attach values to? I know of: https://github.com/ekg/intervaltree which has bugs & is very slow, https://doc.cgal.org/latest/Interval_skip_list/index.html#Chapter_Interval_Skip_List which looks amazing but appears to bring a lot of baggage & I don't know about performance and https://www.boost.org/doc/libs/latest/libs/icl/doc/html/boost/icl/interval_map.html which I hear is slow. Help?
cubeos@bert_hubert My goto library for efficient and well tested c++ algorithms is leda. It used to be commercial but now seems to be free, see https://leda.uni-trier.de/
@cubeos That looks promising, thank you! Will check it out.
@bert_hubert Take a look at the interval_set datatype, that might just do what you need.
@cubeos it does look promising but (understandably) it is hardcoded on double precision intervals, and I need more flexibility than that. Thanks for the tip though, LEDA could be useful for many other things!