2 Apr
2011
2 Apr
'11
4:18 p.m.
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. Regards, Phil.