This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Should the complexity of std::list::size() be O(n) or O(1)?
"Peter Dimov" <pdimov@mmltd.net> writes:
| Gabriel Dos Reis wrote:
| > Jonathan Wakely <jwakely.gcc@gmail.com> writes:
| >
| >> On 11/29/05, Peter Dimov <pdimov@mmltd.net> wrote:
| >>
| >>> If all containers that keep their elements in a contiguous block of
| >>> memory (std::vector, std::string, std::valarray, user-defined
| >>> array, string, matrix
| >>
| >> Sorry for going off on a tangent, but does the standard actually
| >> require contiguous storage for std::string?
| >
| > It does not. But, that does not matter. Just pretend it does and if
| > implementations don't agree you, decree they are not portable <g>.
|
| I think that the general consensus is that while it is theoretically
| possible to implement a non-contiguous conforming string as an
| academic exercise,
>From the discussion, I have not seen a consensus that it would be an
academic exercise. Rather, the consensus was that no implementation
has had taken advantage of that latitude.
-- Gaby