This page is a snapshot from the LWG issues list, see the Library Active Issues List for more information and the meaning of TC1 status.

### 69. Must elements of a vector be contiguous?

Section: 24.3.11 [vector] Status: TC1 Submitter: Andrew Koenig Opened: 1998-07-29 Last modified: 2016-01-28

Priority: Not Prioritized

View all other issues in [vector].

View all issues with TC1 status.

Discussion:

The issue is this: Must the elements of a vector be in contiguous memory?

(Please note that this is entirely separate from the question of whether a vector iterator is required to be a pointer; the answer to that question is clearly "no," as it would rule out debugging implementations)

Proposed resolution:

Add the following text to the end of 24.3.11 [vector], paragraph 1.

> The elements of a vector are stored contiguously, meaning that if v is a `vector<T, Allocator>` where T is some type other than `bool`, then it obeys the identity `&v[n] == &v[0] + n` for all `0 <= n < v.size()`.

Rationale:

The LWG feels that as a practical matter the answer is clearly "yes". There was considerable discussion as to the best way to express the concept of "contiguous", which is not directly defined in the standard. Discussion included:

- An operational definition similar to the above proposed resolution is already used for valarray (28.6.2.4 [valarray.access]).
- There is no need to explicitly consider a user-defined operator& because elements must be copyconstructible (24.2 [container.requirements] para 3) and copyconstructible (16.4.4.2 [utility.arg.requirements]) specifies requirements for operator&.
- There is no issue of one-past-the-end because of language rules.