I already looked in books for some more obscure details of each
algorithm, and haven't found anything excessively difficult. This seems a rather simple project (although I recognize it can take some time). Is there some convention or requirements for data structures in Boost? Is there any difficulty that I should be aware of but didn't notice, or any detail about GSoC that I should know? (I'm new to that program and I feel kind of lost).
FWIW, I would really like to see an improvement of Boost.Intrusive, especially in the field of efficient heaps and queues, rather than have yet another container library in Boost. Just my 2 cents.
That's an interesting idea. If there was a reasonable proposal would you be able and/or willing to mentor it? Andrew Sutton andrew.n.sutton@gmail.com