On 03/03/14 22:08, Kevin Zuniga Garate wrote:
Hello everyone,
I'm Kevin and I'd like to contribute to Boost in this SoC.
I enjoy coding in C++ and participate a lot in competitive programming sites such as TopCoder, Codeforces, etc.
A data structure I have learn from participating in those contests is segment tree.
A segment tree is a data structure for storing data and querying and updating it in intervals, I haven't found a segment tree library in C++, so I thought it may be a good data structure for Boost.
Do you think that would be a good addition for Boost? If not, what other data structure would you like to see implemented?
Greetings.
There was a thread in August 2011 in this list with subject: [fusion] segmented fusion 2.0 It was started by Eric Niebler. I'd guess he'd be interested. -regards, Larry