Re: [boost] Proposal: Monotonic Containers

Subject: Re: [boost] Proposal: Monotonic Containers
From: Scott McMurray (me22.ca+boost_at_[hidden])
Date: 2009-06-14 18:34:24

2009/6/14 Christian Schladetsch <christian.schladetsch_at_[hidden]>:
>
> I have since written rope<T, C>. This presents a sequence container to the
> user, using a list of vectors internally. T is the value_type, C is the
> ChunkSize. Each vector within the list-of-vectors is at least ChunkSize
> long.
>
> It provides O(N/ChunkSize) access time to elements in the sequence. So it is
> slower than a vector, but faster than a list. The speed of access can be
> tuned by the user by varying the ChunkSize.
>
> The main benefit of a rope over a vector is that a rope can grow
> indefinately without ever needing to be resized.
>

How does this differ from a deque?