# Sequence container (C++)

In computing, sequence containers refer to a group of container class templates in the standard library of the C++ programming language that implement storage of data elements. Being templates, they can be used to store arbitrary elements, such as integers or custom classes. One common property of all sequential containers is that the elements can be accessed sequentially. Like all other standard library components, they reside in namespace std.
The following containers are defined in the current revision of the C++ standard: array, vector, list, forward_list, deque. Each of these containers implements different algorithms for data storage, which means that they have different speed guarantees for different operations:
* array implements a compile-time non-resizable array.
* vector implements an array with fast random access and an ability to automatically resize when appending elements.
* deque implements a double-ended queue with comparatively fast random access.
* list implements a doubly linked list.
* forward_list implements a singly linked list.
Since each of the containers needs to be able to copy its elements in order to function properly, the type of the elements must fulfill CopyConstructible and Assignable requirements. For a given container, all elements must belong to the same type. For instance, one cannot store data in the form of both char and int within the same container instance.

## History

Originally, only vector, list and deque were defined. Until the standardization of the C++ language in 1998, they were part of the Standard Template Library (STL), published by SGI. Alexander Stepanov, the primary designer of the STL, bemoans the choice of the name vector, saying that it comes from the older programming languages Scheme and Lisp but is inconsistent with the mathematical meaning of the term.
The array container at first appeared in several books under various names. Later it was incorporated into a Boost library, and was proposed for inclusion in the standard C++ library. The motivation for inclusion of array was that it solves two problems of the C-style array: the lack of an STL-like interface, and an inability to be copied like any other object. It firstly appeared in C++ TR1 and later was incorporated into C++11.
The forward_list container was added to C++11 as a space-efficient alternative to list when reverse iteration is not needed.

## Properties

array, vector and deque all support fast random access to the elements. list supports bidirectional iteration, whereas forward_list supports only unidirectional iteration.
array does not support element insertion or removal. vector supports fast element insertion or removal at the end. Any insertion or removal of an element not at the end of the vector needs elements between the insertion position and the end of the vector to be copied. The iterators to the affected elements are thus invalidated. In fact, any insertion can potentially invalidate all iterators. Also, if the allocated storage in the vector is too small to insert elements, a new array is allocated, all elements are copied or moved to the new array, and the old array is freed. deque, list and forward_list all support fast insertion or removal of elements anywhere in the container. list and forward_list preserves validity of iterators on such operation, whereas deque invalidates all of them.

### Vector

The elements of a vector are stored contiguously. Like all dynamic array implementations, vectors have low memory usage and good locality of reference and data cache utilization. Unlike other STL containers, such as deques and lists, vectors allow the user to denote an initial capacity for the container.
Vectors allow random access; that is, an element of a vector may be referenced in the same manner as elements of arrays (by array indices). Linked-lists and sets, on the other hand, do not support random access or pointer arithmetic.
The vector data structure is able to quickly and easily allocate the necessary memory needed for specific data storage, and it is able to do so in amortized constant time. This is particularly useful for storing data in lists whose length may not be known prior to setting up the list but where removal (other than, perhaps, at the end) is rare. Erasing elements from a vector or even clearing the vector entirely does not necessarily free any of the memory associated with that element.

#### Capacity and reallocation

A typical vector implementation consists, internally, of a pointer to a dynamically allocated array, and possibly data members holding the capacity and size of the vector. The size of the vector refers to the actual number of elements, while the capacity refers to the size of the internal array.
When new elements are inserted, if the new size of the vector becomes larger than its capacity, reallocation occurs. This typically causes the vector to allocate a new region of storage, move the previously held elements to the new region of storage, and free the old region.
Because the addresses of the elements change during this process, any references or iterators to elements in the vector become invalidated. Using an invalidated reference causes undefined behaviour.
The reserve operation may be used to prevent unnecessary reallocations. After a call to reserve(n), the vector's capacity is guaranteed to be at least n.
The vector maintains a certain order of its elements, so that when a new element is inserted at the beginning or in the middle of the vector, subsequent elements are moved backwards in terms of their assignment operator or copy constructor. Consequently, references and iterators to elements after the insertion point become invalidated.
C++ vectors do not support in-place reallocation of memory, by design; i.e., upon reallocation of a vector, the memory it held will always be copied to a new block of memory using its elements' copy constructor, and then released. This is inefficient for cases where the vector holds plain old data and additional contiguous space beyond the held block of memory is available for allocation.

#### Specialization for bool

The Standard Library defines a specialization of the vector template for bool. The description of this specialization indicates that the implementation should pack the elements so that every bool only uses one bit of memory. This is widely considered a mistake. vector<bool> does not meet the requirements for a C++ Standard Library container. For instance, a container<T>::reference must be a true lvalue of type T. This is not the case with vector<bool>::reference, which is a proxy class convertible to bool. Similarly, the vector<bool>::iterator does not yield a bool& when dereferenced. There is a general consensus among the C++ Standard Committee and the Library Working Group that vector<bool> should be deprecated and subsequently removed from the standard library, while the functionality will be reintroduced under a different name.

### List

The list data structure implements a doubly linked list. Data is stored non-contiguously in memory which allows the list data structure to avoid the reallocation of memory that can be necessary with vectors when new elements are inserted into the list.
The list data structure allocates and deallocates memory as needed; therefore, it does not allocate memory that it is not currently using. Memory is freed when an element is removed from the list.
Lists are efficient when inserting new elements in the list; this is an ⁠$O(1)$⁠ operation. No shifting is required like with vectors.
Lists do not have random-access ability like vectors (⁠$O(1)$⁠ operation). Accessing a node in a list is an ⁠$O(n)$⁠ operation that requires a list traversal to find the node that needs to be accessed.
With small data types (such as ints) the memory overhead is much more significant than that of a vector. Each node takes up sizeof(type) + 2 * sizeof(type*). Pointers are typically one word (usually four bytes under 32-bit operating systems), which means that a list of four byte integers takes up approximately three times as much memory as a vector of integers.

### Forward list

The forward_list data structure implements a singly linked list.

### Deque

deque is a container class template that implements a double-ended queue. It provides similar computational complexity to vector for most operations, with the notable exception that it provides amortized constant-time insertion and removal from both ends of the element sequence. Unlike vector, deque uses discontiguous blocks of memory, and provides no means to control the capacity of the container and the moment of reallocation of memory. Like vector, deque offers support for random-access iterators, and insertion and removal of elements invalidates all iterators to the deque.

### Array

array implements a non-resizable array. The size is determined at compile-time by a template parameter. By design, the container does not support allocators because it's basically a C-style array wrapper.

## Overview of functions

The containers are defined in headers named after the names of the containers, e.g. vector is defined in header <vector>. All containers satisfy the requirements of the Container concept, which means they have begin, end, size, max_size, empty, and swap methods.

### Member functions

| Functions | array (C++11) | vector | deque | list | forward_list (C++11) | Description |
| Basics | (implicit) | (constructor) | (constructor) | (constructor) | (constructor) | Constructs the container from variety of sources |
| Basics | (implicit) | (destructor) | (destructor) | (destructor) | (destructor) | Destructs the container and the contained elements |
| Basics | (implicit) | operator= | operator= | operator= | operator= | Assigns values to the container |
| Basics | — | assign | assign | assign | assign | Assigns values to the container |
| Allocators | — | get_allocator | get_allocator | get_allocator | get_allocator | Returns the allocator used to allocate memory for the elements |
| Element access | at | at | at | — | — | Accesses specified element with bounds checking. |
| Element access | operator | operator | operator | — | — | Accesses specified element without bounds checking. |
| Element access | front | front | front | front | front | Accesses the first element |
| Element access | back | back | back | back | — | Accesses the last element |
| Element access | data | data | — | — | — | Accesses the underlying array |
| Iterators | begin cbegin | begin cbegin | begin cbegin | begin cbegin | begin cbegin | Returns an iterator to the beginning of the container |
| Iterators | end cend | end cend | end cend | end cend | end cend | Returns an iterator to the end of the container |
| Iterators | rbegin crbegin | rbegin crbegin | rbegin crbegin | rbegin crbegin | — | Returns a reverse iterator to the reverse beginning of the container |
| Iterators | rend crend | rend crend | rend crend | rend crend | — | Returns a reverse iterator to the reverse end of the container |
| Capacity | empty | empty | empty | empty | empty | Checks whether the container is empty |
| Capacity | size | size | size | size | — | Returns the number of elements in the container. |
| Capacity | max_size | max_size | max_size | max_size | max_size | Returns the maximum possible number of elements in the container. |
| Capacity | — | reserve | — | — | — | Reserves storage in the container |
| Capacity | — | capacity | — | — | — | Returns the number of elements that can be held in currently allocated storage |
| Capacity | — | shrink_to_fit | shrink_to_fit | — | — | Reduces memory usage by freeing unused memory (C++11) |
| Modifiers | — | clear | clear | clear | clear | Clears the contents |
| Modifiers | — | insert | insert | insert | — | Inserts elements |
| Modifiers | — | emplace | emplace | emplace | — | Constructs elements in-place (C++11) |
| Modifiers | — | erase | erase | erase | — | Erases elements |
| Modifiers | — | — | push_front | push_front | push_front | Inserts elements to the beginning |
| Modifiers | — | — | emplace_front | emplace_front | emplace_front | Constructs elements in-place at the beginning (C++11) |
| Modifiers | — | — | pop_front | pop_front | pop_front | Removes the first element |
| Modifiers | — | push_back | push_back | push_back | — | Inserts elements to the end |
| Modifiers | — | emplace_back | emplace_back | emplace_back | — | Constructs elements in-place at the end (C++11) |
| Modifiers | — | pop_back | pop_back | pop_back | — | Removes the last element |
| Modifiers | — | — | — | — | insert_after | Inserts elements after specified position (C++11) |
| Modifiers | — | — | — | — | emplace_after | Constructs elements in-place after specified position (C++11) |
| Modifiers | — | — | — | — | erase_after | Erases elements in-place after specified position (C++11) |
| Modifiers | — | resize | resize | resize | resize | Changes the number of stored elements |
| Modifiers | swap | swap | swap | swap | swap | Swaps the contents with another container of the same type |
| Modifiers | fill | — | — | — | — | Fills the array with the given value |
There are other operations that are available as a part of the list class and there are algorithms that are part of the C++ STL (Algorithm (C++)) that can be used with the list and forward_list class:

#### Operations

* list::merge and forward_list::merge - Merges two sorted lists
* list::splice and forward_list::splice_after - Moves elements from another list
* list::remove and forward_list::remove - Removes elements equal to the given value
* list::remove_if and forward_list::remove_if - Removes elements satisfying specific criteria
* list::reverse and forward_list::reverse - Reverses the order of the elements
* list::unique and forward_list::unique - Removes consecutive duplicate elements
* list::sort and forward_list::sort - Sorts the elements

### Non-member functions
## Usage example

The following example demonstrates various techniques involving a vector and C++ Standard Library algorithms, notably shuffling, sorting, finding the largest element, and erasing from a vector using the erase-remove idiom.
The output will be the following: