From: Peter Palotas (peter_at_[hidden])
Date: 2004-03-16 15:49:23
I was wondering if there is any interest in a container that is a model of
sequence (just like std::vector or std::list) and with an interface matching
that of std::vector (maybe with minor differences due to effiency) but with
different time complexities?
Basically this is a Random Access Container but with the following time
complexity guarantees instead:
* insert/erase anywhere in the list: O(lg n)
* element Access (i.e. [] or at()): O(lg n)
* front()/back(): O(1)
This would make it better than a list for random accessing elements and
better than a vector for inserting/deleting elements in the middle of the
list.
I am currently working of an implementation of this container and thought I
would see if there would be any interest in such a container from the boost
community.
Sincerely,
Peter Palotas