Ion Gaztañaga
El 14/07/2014 20:28, Alexander Kuprijanov escribió:
Hi boost community!
Please tell me something about my container, don't be silent. I firmly intend to offer it to boost, because it's much faster than competitors (by a constant factor).
To make it part of Boost.Container, it should support portable non-raw pointers, move semantics, C++11 allocators and other features supported by Boost.Container.
A btree based data structure seems useful. However, in your links, I see little documentation on how the data structure works, how you mapped an associative container into a sequence container, the implementation of insert,erase,operator[]... That would help a lot to receive more feedback.
Hi Ion! Thank you for feedback. I'll take your advice and add description firstly and C ++11 features then. By the way, it's not exactly "mapping sequence on associative container". It's implementation of the sequence using tree-like structure. Best regards, Aleksandr