On Wed, Nov 30, 2011 at 10:17 PM, Thijs (M.A.) van den Berg <thijs@sitmo.com
wrote:
On Wed, Nov 30, 2011 at 9:06 PM, Thijs (M.A.) van den Berg <thijs@sitmo.com>wrote:
Thank Vadim. For certain applications your container clearly outperforms other. The hierarchical accumulation is particularly interesting if you need to calculate many more accumulations than you need to do inserts. To get a better view of both pros and potential cons, can you also add a comparison for *push_back inserts* (like you did in the multiset) in a std::vector besides the worst case 'before the middle'?
An interesting project!
Thank you again for useful comments. I will add the comparison of push_back() performance in standard sequences (std::list and std::vector) and new sequences that are supported by two types of augmented B+ trees in this project. Regards, Vadim Stadnik