Re: [boost] Proposal: Vector-like container, which takes O(log(N)) for insert/erase

Hi Alexander, Alexander Kuprijanov wrote:

Hi, everybody! I've implemented a container, which has interface similar to vector and takes O(log(N)) for inserting/erasing. Shortly speaking, it has BTrees inside and intrusive leaves, and exploits idea of so-called "rope". I would like to name it alex_kupriianov_array (after myself) and add it to boost.

Why not alex_kupriianov_btrees_rope? ;) But seriously, wouldn't it be more convenient to have separate B-tree and rope data structures implementations?

Please tell me who is the coordinator of containers and what is the procedure of adding something to boost.

www.boost.org/development/submissions.html Regards, Adam