[sequences] - C++11 → C++14

Files changed (1) hide show

tmp/tmp905gizab/{from.md → to.md} +190 -223

tmp/tmp905gizab/{from.md → to.md} RENAMED Viewed

@@ -37,15 +37,15 @@ namespace std {
   template <class T, size_t N>
     struct tuple_size<array<T, N> >;
   template <size_t I, class T, size_t N>
     struct tuple_element<I, array<T, N> >;
   template <size_t I, class T, size_t N>
-    T& get(array<T, N>&) noexcept;
   template <size_t I, class T, size_t N>
-    T&& get(array<T, N>&&) noexcept;
   template <size_t I, class T, size_t N>
-    const T& get(const array<T, N>&) noexcept;
 }
 ```
 \synopsis{Header \texttt{\<deque\>} synopsis}
@@ -144,10 +144,11 @@ namespace std {
   template <class Allocator> class vector<bool,Allocator>;
   // hash support
   template <class T> struct hash;
   template <class Allocator> struct hash<vector<bool, Allocator> >;
 ```
 ### Class template `array` <a id="array">[[array]]</a>
 #### Class template `array` overview <a id="array.overview">[[array.overview]]</a>
@@ -190,12 +191,12 @@ namespace std {
     typedef size_t                                size_type;
     typedef ptrdiff_t                             difference_type;
     typedef T                                     value_type;
     typedef T*                                    pointer;
     typedef const T*                              const_pointer;
-    typedef reverse_iterator<iterator> reverse_iterator;
-    typedef reverse_iterator<const_iterator> const_reverse_iterator;
     T       elems[N];           // exposition only
     // no explicit construct/copy/destroy for aggregate type
@@ -217,23 +218,23 @@ namespace std {
     const_iterator         cend() const noexcept;
     const_reverse_iterator crbegin() const noexcept;
     const_reverse_iterator crend() const noexcept;
     // capacity:
-    constexpr size_type size() noexcept;
-    constexpr size_type max_size() noexcept;
-    constexpr bool      empty() noexcept;
     // element access:
     reference                 operator[](size_type n);
-    const_reference operator[](size_type n) const;
-    const_reference at(size_type n) const;
     reference                 at(size_type n);
     reference                 front();
-    const_reference front() const;
     reference                 back();
-    const_reference back() const;
     T *       data() noexcept;
     const T * data() const noexcept;
   };
 }
@@ -264,16 +265,16 @@ template <class T, size_t N> void swap(array<T,N>& x, array<T,N>& y) noexcept(no
 ``` cpp
 x.swap(y);
 ```
-*Complexity:* linear in `N`.
 #### `array::size` <a id="array.size">[[array.size]]</a>
 ``` cpp
-template <class T, size_t N> constexpr size_type array<T,N>::size() noexcept;
 ```
 *Returns:* `N`
 #### `array::data` <a id="array.data">[[array.data]]</a>
@@ -302,11 +303,11 @@ void swap(array& y) noexcept(noexcept(swap(declval<T&>(), declval<T&>())));
 *Effects:* `swap_ranges(begin(), end(), y.begin())`
 *Throws:* Nothing unless one of the element-wise swap calls throws an
 exception.
-*Note:* Unlike the `swap` function for other containers, array::swap
 takes linear time, may exit via an exception, and does not cause
 iterators to become associated with the other container.
 #### Zero sized arrays <a id="array.zero">[[array.zero]]</a>
@@ -322,42 +323,43 @@ Member function `swap()` shall have a *noexcept-specification* which is
 equivalent to `noexcept(true)`.
 #### Tuple interface to class template `array` <a id="array.tuple">[[array.tuple]]</a>
 ``` cpp
-tuple_size<array<T, N> >::value
 ```
-*Return type:* integral constant expression.
-*Value:* `N`
 ``` cpp
 tuple_element<I, array<T, N> >::type
 ```
 *Requires:* `I < N`. The program is ill-formed if `I` is out of bounds.
 *Value:* The type T.
 ``` cpp
-template <size_t I, class T, size_t N> T& get(array<T, N>& a) noexcept;
 ```
 *Requires:* `I < N`. The program is ill-formed if `I` is out of bounds.
 *Returns:* A reference to the `I`th element of `a`, where indexing is
 zero-based.
 ``` cpp
-template <size_t I, class T, size_t N> T&& get(array<T, N>&& a) noexcept;
 ```
 *Effects:* Equivalent to `return std::move(get<I>(a));`
 ``` cpp
-template <size_t I, class T, size_t N> const T& get(const array<T, N>& a) noexcept;
 ```
 *Requires:* `I < N`. The program is ill-formed if `I` is out of bounds.
 *Returns:* A const reference to the `I`th element of `a`, where indexing
@@ -401,12 +403,13 @@ namespace std {
     typedef typename allocator_traits<Allocator>::const_pointer     const_pointer;
     typedef std::reverse_iterator<iterator>       reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     // [deque.cons], construct/copy/destroy:
- explicit deque(const Allocator& = Allocator());
-    explicit deque(size_type n);
     deque(size_type n, const T& value, const Allocator& = Allocator());
     template <class InputIterator>
       deque(InputIterator first, InputIterator last, const Allocator& = Allocator());
     deque(const deque& x);
     deque(deque&&);
@@ -503,24 +506,25 @@ namespace std {
 ```
 #### `deque` constructors, copy, and assignment <a id="deque.cons">[[deque.cons]]</a>
 ``` cpp
-explicit deque(const Allocator& = Allocator());
 ```
 *Effects:* Constructs an empty `deque`, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
-explicit deque(size_type n);
 ```
-*Effects:* Constructs a `deque` with `n` value-initialized elements.
-*Requires:* `T` shall be `DefaultConstructible`.
 *Complexity:* Linear in `n`.
 ``` cpp
 deque(size_type n, const T& value,
@@ -541,71 +545,46 @@ template <class InputIterator>
 ```
 *Effects:* Constructs a `deque` equal to the range \[`first`, `last`),
 using the specified allocator.
-*Complexity:* `distance(first, last)`.
-``` cpp
-template <class InputIterator>
-  void assign(InputIterator first, InputIterator last);
-```
-*Effects:*
-``` cpp
-erase(begin(), end());
-insert(begin(), first, last);
-```
-``` cpp
-void assign(size_type n, const T& t);
-```
-*Effects:*
-``` cpp
-erase(begin(), end());
-insert(begin(), n, t);
-```
 #### `deque` capacity <a id="deque.capacity">[[deque.capacity]]</a>
 ``` cpp
 void resize(size_type sz);
 ```
-*Effects:* If `sz <= size()`, equivalent to
-`erase(begin() + sz, end());`. If `size() < sz`, appends `sz - size()`
-value-initialized elements to the sequence.
-*Requires:* `T` shall be `DefaultConstructible`.
 ``` cpp
 void resize(size_type sz, const T& c);
 ```
-*Effects:*
-``` cpp
-if (sz > size())
-  insert(end(), sz-size(), c);
-else if (sz < size())
-  erase(begin()+sz, end());
-else
-  ;                 // do nothing
-```
 *Requires:* `T` shall be `CopyInsertable` into `*this`.
 ``` cpp
 void shrink_to_fit();
 ```
-*Remarks:* `shrink_to_fit` is a non-binding request to reduce memory
-use. The request is non-binding to allow latitude for
-implementation-specific optimizations.
 #### `deque` modifiers <a id="deque.modifiers">[[deque.modifiers]]</a>
 ``` cpp
 iterator insert(const_iterator position, const T& x);
@@ -630,12 +609,14 @@ iterators and references to elements of the deque. An insertion at
 either end of the deque invalidates all the iterators to the deque, but
 has no effect on the validity of references to elements of the deque.
 *Remarks:* If an exception is thrown other than by the copy constructor,
 move constructor, assignment operator, or move assignment operator of
-`T` there are no effects. If an exception is thrown by the move
-constructor of a non-`CopyInsertable` `T`, the effects are unspecified.
 *Complexity:* The complexity is linear in the number of elements
 inserted plus the lesser of the distances to the beginning and end of
 the deque. Inserting a single element either at the beginning or end of
 a deque always takes constant time and causes a single call to a
@@ -689,23 +670,23 @@ access to list elements is not supported. It is intended that
 hand-written C-style singly linked list. Features that would conflict
 with that goal have been omitted.
 A `forward_list` satisfies all of the requirements of a container
 (Table  [[tab:containers.container.requirements]]), except that the
-`size()` member function is not provided. A `forward_list` also
-satisfies all of the requirements for an allocator-aware container
-(Table  [[tab:containers.allocatoraware]]). In addition, a
-`forward_list` provides the `assign` member functions (Table
-[[tab:containers.sequence.requirements]]) and several of the optional
-container requirements (Table  [[tab:containers.sequence.optional]]).
-Descriptions are provided here only for operations on `forward_list`
-that are not described in that table or for operations where there is
-additional semantic information.
 Modifying any list requires access to the element preceding the first
 element of interest, but in a `forward_list` there is no constant-time
-way to acess a preceding element. For this reason, ranges that are
 modified, such as those supplied to `erase` and `splice`, must be open
 at the beginning.
 ``` cpp
 namespace std {
@@ -723,12 +704,13 @@ namespace std {
     typedef Allocator allocator_type;
     typedef typename allocator_traits<Allocator>::pointer         pointer;
     typedef typename allocator_traits<Allocator>::const_pointer   const_pointer;
     // [forwardlist.cons], construct/copy/destroy:
- explicit forward_list(const Allocator& = Allocator());
-    explicit forward_list(size_type n);
     forward_list(size_type n, const T& value,
                  const Allocator& = Allocator());
     template <class InputIterator>
       forward_list(InputIterator first, InputIterator last,
                    const Allocator& = Allocator());
@@ -840,26 +822,26 @@ namespace std {
 ```
 #### `forward_list` constructors, copy, assignment <a id="forwardlist.cons">[[forwardlist.cons]]</a>
 ``` cpp
-explicit forward_list(const Allocator& = Allocator());
 ```
 *Effects:* Constructs an empty `forward_list` object using the specified
 allocator.
 *Complexity:* Constant.
 ``` cpp
-explicit forward_list(size_type n);
 ```
-*Effects:* Constructs a `forward_list` object with `n` value-initialized
-elements.
-*Requires:* `T` shall be `DefaultConstructible`.
 *Complexity:* Linear in `n`.
 ``` cpp
 forward_list(size_type n, const T& value, const Allocator& = Allocator());
@@ -880,23 +862,10 @@ template <class InputIterator>
 *Effects:* Constructs a `forward_list` object equal to the range
 \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
-``` cpp
-template <class InputIterator>
-  void assign(InputIterator first, InputIterator last);
-```
-*Effects:* `clear(); insert_after(before_begin(), first, last);`
-``` cpp
-void assign(size_type n, const T& t);
-```
-*Effects:* `clear(); insert_after(before_begin(), n, t);`
 #### `forward_list` iterators <a id="forwardlist.iter">[[forwardlist.iter]]</a>
 ``` cpp
 iterator before_begin() noexcept;
 const_iterator before_begin() const noexcept;
@@ -995,11 +964,11 @@ iterator insert_after(const_iterator position, initializer_list<T> il);
 ```
 *Effects:* `insert_after(p, il.begin(), il.end())`.
 *Returns:* An iterator pointing to the last inserted element or
-`position` if `i1` is empty.
 ``` cpp
 template <class... Args>
   iterator emplace_after(const_iterator position, Args&&... args);
 ```
@@ -1039,21 +1008,31 @@ dereferenceable.
 *Throws:* Nothing.
 ``` cpp
 void resize(size_type sz);
 void resize(size_type sz, const value_type& c);
 ```
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
-inserts `sz - distance(begin(), end())` elements at the end of the list.
-For the first signature the inserted elements are value-initialized, and
-for the second signature they are copies of `c`.
-*Requires:* `T` shall be `DefaultConstructible` for the first form and
-it shall be `CopyInsertable` into `*this` for the second form.
 ``` cpp
 void clear() noexcept;
 ```
@@ -1067,11 +1046,12 @@ void clear() noexcept;
 void splice_after(const_iterator position, forward_list& x);
 void splice_after(const_iterator position, forward_list&& x);
 ```
 *Requires:* `position` is `before_begin()` or is a dereferenceable
-iterator in the range \[`begin()`, `end()`). `&x != this`.
 *Effects:* Inserts the contents of `x` after `position`, and `x` becomes
 empty. Pointers and references to the moved elements of `x` now refer to
 those same elements but as members of `*this`. Iterators referring to
 the moved elements will continue to refer to their elements, but they
@@ -1087,17 +1067,18 @@ void splice_after(const_iterator position, forward_list&& x, const_iterator i);
 ```
 *Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`). The iterator following `i`
 is a dereferenceable iterator in `x`.
 *Effects:* Inserts the element following `i` into `*this`, following
 `position`, and removes it from `x`. The result is unchanged if
-`position == i` or `position == ++i`. Pointers and references to `*i`
 continue to refer to the same element but as a member of `*this`.
-Iterators to `*i` (including `i` itself) continue to refer to the same
-element, but now behave as iterators into `*this`, not into `x`.
 *Throws:* Nothing.
 *Complexity:* 𝑂(1)
@@ -1110,11 +1091,11 @@ void splice_after(const_iterator position, forward_list&& x,
 *Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`). (`first`, `last`) is a
 valid range in `x`, and all iterators in the range (`first`, `last`) are
 dereferenceable. `position` is not an iterator in the range (`first`,
-`last`).
 *Effects:* Inserts elements in the range (`first`, `last`) after
 `position` and removes the elements from `x`. Pointers and references to
 the moved elements of `x` now refer to those same elements but as
 members of `*this`. Iterators referring to the moved elements will
@@ -1128,18 +1109,18 @@ void remove(const T& value);
 template <class Predicate> void remove_if(Predicate pred);
 ```
 *Effects:* Erases all the elements in the list referred by a list
 iterator `i` for which the following conditions hold: `*i == value` (for
-`remove()`), `pred(*i)` is true (for `remove_if()`). This operation
-shall be stable: the relative order of the elements that are not removed
-is the same as their relative order in the original list. Invalidates
-only the iterators and references to the erased elements.
 *Throws:* Nothing unless an exception is thrown by the equality
 comparison or the predicate.
 *Complexity:* Exactly `distance(begin(), end())` applications of the
 corresponding predicate.
 ``` cpp
 void unique();
@@ -1161,28 +1142,32 @@ comparison or the predicate.
 otherwise no applications of the predicate.
 ``` cpp
 void merge(forward_list& x);
 void merge(forward_list&& x);
-template <class Compare> void merge(forward_list& x, Compare comp)
-template <class Compare> void merge(forward_list&& x, Compare comp)
 ```
 *Requires:* `comp` defines a strict weak ordering ([[alg.sorting]]),
 and `*this` and `x` are both sorted according to this ordering.
-*Effects:* Merges `x` into `*this`. This operation shall be stable: for
-equivalent elements in the two lists, the elements from `*this` shall
-always precede the elements from `x`. `x` is empty after the merge. If
-an exception is thrown other than by a comparison there are no effects.
-Pointers and references to the moved elements of `x` now refer to those
-same elements but as members of `*this`. Iterators referring to the
-moved elements will continue to refer to their elements, but they now
-behave as iterators into `*this`, not into `x`.
-*Complexity:* At most distance(begin(), end()) + distance(x.begin(),
-x.end()) - 1 comparisons.
 ``` cpp
 void sort();
 template <class Compare> void sort(Compare comp);
 ```
@@ -1190,14 +1175,15 @@ template <class Compare> void sort(Compare comp);
 *Requires:* `operator<` (for the version with no arguments) or `comp`
 (for the version with a comparison argument) defines a strict weak
 ordering ([[alg.sorting]]).
 *Effects:* Sorts the list according to the `operator<` or the `comp`
-function object. This operation shall be stable: the relative order of
-the equivalent elements is preserved. If an exception is thrown the
-order of the elements in `*this` is unspecified. Does not affect the
-validity of iterators and references.
 *Complexity:* Approximately N log N comparisons, where N is
 `distance(begin(), end())`.
 ``` cpp
@@ -1258,12 +1244,13 @@ namespace std {
     typedef typename allocator_traits<Allocator>::const_pointer     const_pointer;
     typedef std::reverse_iterator<iterator>       reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     // [list.cons], construct/copy/destroy:
- explicit list(const Allocator& = Allocator());
-    explicit list(size_type n);
     list(size_type n, const T& value, const Allocator& = Allocator());
     template <class InputIterator>
       list(InputIterator first, InputIterator last, const Allocator& = Allocator());
     list(const list& x);
     list(list&& x);
@@ -1380,24 +1367,25 @@ namespace std {
 ```
 #### `list` constructors, copy, and assignment <a id="list.cons">[[list.cons]]</a>
 ``` cpp
-explicit list(const Allocator& = Allocator());
 ```
 *Effects:* Constructs an empty list, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
-explicit list(size_type n);
 ```
-*Effects:* Constructs a `list` with `n` value-initialized elements.
-*Requires:* `T` shall be `DefaultConstructible`.
 *Complexity:* Linear in `n`.
 ``` cpp
 list(size_type n, const T& value,
@@ -1419,40 +1407,26 @@ list(InputIterator first, InputIterator last,
 *Effects:* Constructs a `list` equal to the range \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
-``` cpp
-template <class InputIterator>
-  void assign(InputIterator first, InputIterator last);
-```
-*Effects:* Replaces the contents of the list with the range
-`[first, last)`.
-``` cpp
-void assign(size_type n, const T& t);
-```
-*Effects:* Replaces the contents of the list with `n` copies of `t`.
 #### `list` capacity <a id="list.capacity">[[list.capacity]]</a>
 ``` cpp
 void resize(size_type sz);
 ```
-*Effects:* If `size() < sz`, appends `sz - size()` value-initialized
 elements to the sequence. If `sz <= size()`, equivalent to
 ``` cpp
 list<T>::iterator it = begin();
 advance(it, sz);
 erase(it, end());
 ```
-*Requires:* `T` shall be `DefaultConstructible`.
 ``` cpp
 void resize(size_type sz, const T& c);
 ```
@@ -1597,11 +1571,11 @@ iterator `i` for which the following conditions hold:
 references to the erased elements.
 *Throws:* Nothing unless an exception is thrown by `*i == value` or
 `pred(*i) != false`.
-*Remarks:* Stable.
 *Complexity:* Exactly `size()` applications of the corresponding
 predicate.
 ``` cpp
@@ -1614,11 +1588,11 @@ of equal elements referred to by the iterator `i` in the range
 \[`first + 1`, `last`) for which `*i == *(i-1)` (for the version of
 `unique` with no arguments) or `pred(*i, *(i - 1))` (for the version of
 `unique` with a predicate argument) holds. Invalidates only the
 iterators and references to the erased elements.
-*Throws:* Nothing unless an exception in thrown by `*i == *(i-1)` or
 `pred(*i, *(i - 1))`
 *Complexity:* If the range `[first, last)` is not empty, exactly
 `(last - first) - 1` applications of the corresponding predicate,
 otherwise no applications of the predicate.
@@ -1643,13 +1617,14 @@ according to the ordering defined by `comp`; that is, for every iterator
 elements of `x` now refer to those same elements but as members of
 `*this`. Iterators referring to the moved elements will continue to
 refer to their elements, but they now behave as iterators into `*this`,
 not into `x`.
-*Remarks:* Stable. If `(&x != this)` the range `[x.begin(), x.end())` is
-empty after the merge. No elements are copied by this operation. The
-behavior is undefined if `this->get_allocator() != x.get_allocator()`.
 *Complexity:* At most `size() + x.size() - 1` applications of `comp` if
 `(&x != this)`; otherwise, no applications of `comp` are performed. If
 an exception is thrown other than by a comparison there are no effects.
@@ -1672,11 +1647,11 @@ second version) shall define a strict weak ordering ([[alg.sorting]]).
 *Effects:* Sorts the list according to the `operator<` or a `Compare`
 function object. Does not affect the validity of iterators and
 references.
-*Remarks:* Stable.
 *Complexity:* Approximately N log(N) comparisons, where `N == size()`.
 #### `list` specialized algorithms <a id="list.special">[[list.special]]</a>
@@ -1733,12 +1708,13 @@ namespace std {
     typedef typename allocator_traits<Allocator>::const_pointer     const_pointer;
     typedef std::reverse_iterator<iterator>       reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     // [vector.cons], construct/copy/destroy:
- explicit vector(const Allocator& = Allocator());
-    explicit vector(size_type n);
     vector(size_type n, const T& value, const Allocator& = Allocator());
     template <class InputIterator>
       vector(InputIterator first, InputIterator last,
              const Allocator& = Allocator());
     vector(const vector& x);
@@ -1835,24 +1811,25 @@ namespace std {
 ```
 #### `vector` constructors, copy, and assignment <a id="vector.cons">[[vector.cons]]</a>
 ``` cpp
-explicit vector(const Allocator& = Allocator());
 ```
 *Effects:* Constructs an empty `vector`, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
-explicit vector(size_type n);
 ```
-*Effects:* Constructs a `vector` with `n` value-initialized elements.
-*Requires:* `T` shall be `DefaultConstructible`.
 *Complexity:* Linear in `n`.
 ``` cpp
 vector(size_type n, const T& value,
@@ -1879,33 +1856,10 @@ using the specified allocator.
 is the distance between `first` and `last`) and no reallocations if
 iterators first and last are of forward, bidirectional, or random access
 categories. It makes order `N` calls to the copy constructor of `T` and
 order log(N) reallocations if they are just input iterators.
-``` cpp
-template <class InputIterator>
-  void assign(InputIterator first, InputIterator last);
-```
-*Effects:*
-``` cpp
-erase(begin(), end());
-insert(begin(), first, last);
-```
-``` cpp
-void assign(size_type n, const T& t);
-```
-*Effects:*
-``` cpp
-erase(begin(), end());
-insert(begin(), n, t);
-```
 #### `vector` capacity <a id="vector.capacity">[[vector.capacity]]</a>
 ``` cpp
 size_type capacity() const noexcept;
 ```
@@ -1915,10 +1869,12 @@ requiring reallocation.
 ``` cpp
 void reserve(size_type n);
 ```
 *Effects:* A directive that informs a `vector` of a planned change in
 size, so that it can manage the storage allocation accordingly. After
 `reserve()`, `capacity()` is greater or equal to the argument of
 `reserve` if reallocation happens; and equal to the previous value of
 `capacity()` otherwise. Reallocation happens at this point if and only
@@ -1930,22 +1886,28 @@ non-`CopyInsertable` type, there are no effects.
 most linear time in the size of the sequence.
 *Throws:* `length_error` if `n > max_size()`.[^4]
 *Remarks:* Reallocation invalidates all the references, pointers, and
-iterators referring to the elements in the sequence. It is guaranteed
-that no reallocation takes place during insertions that happen after a
-call to `reserve()` until the time when an insertion would make the size
-of the vector greater than the value of `capacity()`.
 ``` cpp
 void shrink_to_fit();
 ```
 *Remarks:* `shrink_to_fit` is a non-binding request to reduce
 `capacity()` to `size()`. The request is non-binding to allow latitude
-for implementation-specific optimizations.
 ``` cpp
 void swap(vector& x);
 ```
@@ -1956,34 +1918,32 @@ of `x`.
 ``` cpp
 void resize(size_type sz);
 ```
-*Effects:* If `sz <= size()`, equivalent to
-`erase(begin() + sz, end());`. If `size() < sz`, appends `sz - size()`
-value-initialized elements to the sequence.
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
-``` cpp
-void resize(size_type sz, const T& c);
-```
-*Effects:*
-``` cpp
-if (sz > size())
-  insert(end(), sz-size(), c);
-else if (sz < size())
-  erase(begin()+sz, end());
-else
-  ;                 // do nothing
-```
-*Requires:* If an exception is thrown other than by the move constructor
 of a non-`CopyInsertable` `T` there are no effects.
 #### `vector` data <a id="vector.data">[[vector.data]]</a>
 ``` cpp
 T*         data() noexcept;
 const T*   data() const noexcept;
@@ -2013,12 +1973,15 @@ void push_back(T&& x);
 *Remarks:* Causes reallocation if the new size is greater than the old
 capacity. If no reallocation happens, all the iterators and references
 before the insertion point remain valid. If an exception is thrown other
 than by the copy constructor, move constructor, assignment operator, or
 move assignment operator of `T` or by any `InputIterator` operation
-there are no effects. If an exception is thrown by the move constructor
-of a non-`CopyInsertable` `T`, the effects are unspecified.
 *Complexity:* The complexity is linear in the number of elements
 inserted plus the distance to the end of the vector.
 ``` cpp
@@ -2084,12 +2047,14 @@ namespace std {
       reference& operator=(const reference& x) noexcept;
       void flip() noexcept;     // flips the bit
     };
     // construct/copy/destroy:
- explicit vector(const Allocator& = Allocator());
-    explicit vector(size_type n, const bool& value = bool(),
            const Allocator& = Allocator());
     template <class InputIterator>
       vector(InputIterator first, InputIterator last,
              const Allocator& = Allocator());
     vector(const vector<bool,Allocator>& x);
@@ -2098,15 +2063,15 @@ namespace std {
     vector(vector&&, const Allocator&);
     vector(initializer_list<bool>, const Allocator& = Allocator()));
    ~vector();
     vector<bool,Allocator>& operator=(const vector<bool,Allocator>& x);
     vector<bool,Allocator>& operator=(vector<bool,Allocator>&& x);
-    vector operator=(initializer_list<bool>);
     template <class InputIterator>
       void assign(InputIterator first, InputIterator last);
     void assign(size_type n, const bool& t);
-    void assign(initializer_list<bool>;
     allocator_type get_allocator() const noexcept;
     // iterators:
     iterator               begin() noexcept;
     const_iterator         begin() const noexcept;
@@ -2140,12 +2105,14 @@ namespace std {
     const_reference front() const;
     reference       back();
     const_reference back() const;
     // modifiers:
     void push_back(const bool& x);
     void pop_back();
     iterator insert(const_iterator position, const bool& x);
     iterator insert (const_iterator position, size_type n, const bool& x);
     template <class InputIterator>
         iterator insert(const_iterator position,
                         InputIterator first, InputIterator last);
@@ -2199,8 +2166,8 @@ y = b;
 ``` cpp
 template <class Allocator> struct hash<vector<bool, Allocator> >;
 ```
-*Requires:* the template specialization shall meet the requirements of
-class template `hash` ([[unord.hash]]).

   template <class T, size_t N>
     struct tuple_size<array<T, N> >;
   template <size_t I, class T, size_t N>
     struct tuple_element<I, array<T, N> >;
   template <size_t I, class T, size_t N>
+ constexpr T& get(array<T, N>&) noexcept;
   template <size_t I, class T, size_t N>
+ constexpr T&& get(array<T, N>&&) noexcept;
   template <size_t I, class T, size_t N>
+ constexpr const T& get(const array<T, N>&) noexcept;
 }
 ```
 \synopsis{Header \texttt{\<deque\>} synopsis}
   template <class Allocator> class vector<bool,Allocator>;
   // hash support
   template <class T> struct hash;
   template <class Allocator> struct hash<vector<bool, Allocator> >;
+}
 ```
 ### Class template `array` <a id="array">[[array]]</a>
 #### Class template `array` overview <a id="array.overview">[[array.overview]]</a>
     typedef size_t                                size_type;
     typedef ptrdiff_t                             difference_type;
     typedef T                                     value_type;
     typedef T*                                    pointer;
     typedef const T*                              const_pointer;
+    typedef std::reverse_iterator<iterator> reverse_iterator;
+    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     T       elems[N];           // exposition only
     // no explicit construct/copy/destroy for aggregate type
     const_iterator         cend() const noexcept;
     const_reverse_iterator crbegin() const noexcept;
     const_reverse_iterator crend() const noexcept;
     // capacity:
+    constexpr size_type size() const noexcept;
+    constexpr size_type max_size() const noexcept;
+    constexpr bool      empty() const noexcept;
     // element access:
     reference                 operator[](size_type n);
+ constexpr const_reference operator[](size_type n) const;
     reference                 at(size_type n);
+    constexpr const_reference at(size_type n) const;
     reference                 front();
+ constexpr const_reference front() const;
     reference                 back();
+ constexpr const_reference back() const;
     T *       data() noexcept;
     const T * data() const noexcept;
   };
 }
 ``` cpp
 x.swap(y);
 ```
+*Complexity:* Linear in `N`.
 #### `array::size` <a id="array.size">[[array.size]]</a>
 ``` cpp
+template <class T, size_t N> constexpr size_type array<T,N>::size() const noexcept;
 ```
 *Returns:* `N`
 #### `array::data` <a id="array.data">[[array.data]]</a>
 *Effects:* `swap_ranges(begin(), end(), y.begin())`
 *Throws:* Nothing unless one of the element-wise swap calls throws an
 exception.
+*Note:* Unlike the `swap` function for other containers, `array::swap`
 takes linear time, may exit via an exception, and does not cause
 iterators to become associated with the other container.
 #### Zero sized arrays <a id="array.zero">[[array.zero]]</a>
 equivalent to `noexcept(true)`.
 #### Tuple interface to class template `array` <a id="array.tuple">[[array.tuple]]</a>
 ``` cpp
+template <class T, size_t N>
+struct tuple_size<array<T, N>>
+  : integral_constant<size_t, N> { };
 ```
 ``` cpp
 tuple_element<I, array<T, N> >::type
 ```
 *Requires:* `I < N`. The program is ill-formed if `I` is out of bounds.
 *Value:* The type T.
 ``` cpp
+template <size_t I, class T, size_t N>
+constexpr T& get(array<T, N>& a) noexcept;
 ```
 *Requires:* `I < N`. The program is ill-formed if `I` is out of bounds.
 *Returns:* A reference to the `I`th element of `a`, where indexing is
 zero-based.
 ``` cpp
+template <size_t I, class T, size_t N>
+constexpr T&& get(array<T, N>&& a) noexcept;
 ```
 *Effects:* Equivalent to `return std::move(get<I>(a));`
 ``` cpp
+template <size_t I, class T, size_t N>
+constexpr const T& get(const array<T, N>& a) noexcept;
 ```
 *Requires:* `I < N`. The program is ill-formed if `I` is out of bounds.
 *Returns:* A const reference to the `I`th element of `a`, where indexing
     typedef typename allocator_traits<Allocator>::const_pointer     const_pointer;
     typedef std::reverse_iterator<iterator>       reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     // [deque.cons], construct/copy/destroy:
+    deque() : deque(Allocator()) { }
+    explicit deque(const Allocator&);
+    explicit deque(size_type n, const Allocator& = Allocator());
     deque(size_type n, const T& value, const Allocator& = Allocator());
     template <class InputIterator>
       deque(InputIterator first, InputIterator last, const Allocator& = Allocator());
     deque(const deque& x);
     deque(deque&&);
 ```
 #### `deque` constructors, copy, and assignment <a id="deque.cons">[[deque.cons]]</a>
 ``` cpp
+explicit deque(const Allocator&);
 ```
 *Effects:* Constructs an empty `deque`, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
+explicit deque(size_type n, const Allocator& = Allocator());
 ```
+*Effects:* Constructs a `deque` with `n` default-inserted elements using
+the specified allocator.
+*Requires:* `T` shall be `DefaultInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 deque(size_type n, const T& value,
 ```
 *Effects:* Constructs a `deque` equal to the range \[`first`, `last`),
 using the specified allocator.
+*Complexity:* Linear in `distance(first, last)`.
 #### `deque` capacity <a id="deque.capacity">[[deque.capacity]]</a>
 ``` cpp
 void resize(size_type sz);
 ```
+*Effects:* If `sz <= size()`, equivalent to calling `pop_back()`
+`size() - sz` times. If `size() < sz`, appends `sz - size()`
+default-inserted elements to the sequence.
+*Requires:* `T` shall be `MoveInsertable` and `DefaultInsertable` into
+`*this`.
 ``` cpp
 void resize(size_type sz, const T& c);
 ```
+*Effects:* If `sz <= size()`, equivalent to calling `pop_back()`
+`size() - sz` times. If `size() < sz`, appends `sz - size()` copies of
+`c` to the sequence.
 *Requires:* `T` shall be `CopyInsertable` into `*this`.
 ``` cpp
 void shrink_to_fit();
 ```
+*Requires:* `T` shall be `MoveInsertable` into `*this`.
+*Complexity:* Linear in the size of the sequence.
+*Remarks:* `shrink_to_fit` is a non-binding request to reduce memory use
+but does not change the size of the sequence. The request is non-binding
+to allow latitude for implementation-specific optimizations.
 #### `deque` modifiers <a id="deque.modifiers">[[deque.modifiers]]</a>
 ``` cpp
 iterator insert(const_iterator position, const T& x);
 either end of the deque invalidates all the iterators to the deque, but
 has no effect on the validity of references to elements of the deque.
 *Remarks:* If an exception is thrown other than by the copy constructor,
 move constructor, assignment operator, or move assignment operator of
+`T` there are no effects. If an exception is thrown while inserting a
+single element at either end, there are no effects. Otherwise, if an
+exception is thrown by the move constructor of a non-`CopyInsertable`
+`T`, the effects are unspecified.
 *Complexity:* The complexity is linear in the number of elements
 inserted plus the lesser of the distances to the beginning and end of
 the deque. Inserting a single element either at the beginning or end of
 a deque always takes constant time and causes a single call to a
 hand-written C-style singly linked list. Features that would conflict
 with that goal have been omitted.
 A `forward_list` satisfies all of the requirements of a container
 (Table  [[tab:containers.container.requirements]]), except that the
+`size()` member function is not provided and `operator==` has linear
+complexity. A `forward_list` also satisfies all of the requirements for
+an allocator-aware container (Table  [[tab:containers.allocatoraware]]).
+In addition, a `forward_list` provides the `assign` member functions
+(Table  [[tab:containers.sequence.requirements]]) and several of the
+optional container requirements (Table
+[[tab:containers.sequence.optional]]). Descriptions are provided here
+only for operations on `forward_list` that are not described in that
+table or for operations where there is additional semantic information.
 Modifying any list requires access to the element preceding the first
 element of interest, but in a `forward_list` there is no constant-time
+way to access a preceding element. For this reason, ranges that are
 modified, such as those supplied to `erase` and `splice`, must be open
 at the beginning.
 ``` cpp
 namespace std {
     typedef Allocator allocator_type;
     typedef typename allocator_traits<Allocator>::pointer         pointer;
     typedef typename allocator_traits<Allocator>::const_pointer   const_pointer;
     // [forwardlist.cons], construct/copy/destroy:
+    forward_list() : forward_list(Allocator()) { }
+    explicit forward_list(const Allocator&);
+    explicit forward_list(size_type n, const Allocator& = Allocator());
     forward_list(size_type n, const T& value,
                  const Allocator& = Allocator());
     template <class InputIterator>
       forward_list(InputIterator first, InputIterator last,
                    const Allocator& = Allocator());
 ```
 #### `forward_list` constructors, copy, assignment <a id="forwardlist.cons">[[forwardlist.cons]]</a>
 ``` cpp
+explicit forward_list(const Allocator&);
 ```
 *Effects:* Constructs an empty `forward_list` object using the specified
 allocator.
 *Complexity:* Constant.
 ``` cpp
+explicit forward_list(size_type n, const Allocator& = Allocator());
 ```
+*Effects:* Constructs a `forward_list` object with `n` default-inserted
+elements using the specified allocator.
+*Requires:* `T` shall be `DefaultInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 forward_list(size_type n, const T& value, const Allocator& = Allocator());
 *Effects:* Constructs a `forward_list` object equal to the range
 \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
 #### `forward_list` iterators <a id="forwardlist.iter">[[forwardlist.iter]]</a>
 ``` cpp
 iterator before_begin() noexcept;
 const_iterator before_begin() const noexcept;
 ```
 *Effects:* `insert_after(p, il.begin(), il.end())`.
 *Returns:* An iterator pointing to the last inserted element or
+`position` if `il` is empty.
 ``` cpp
 template <class... Args>
   iterator emplace_after(const_iterator position, Args&&... args);
 ```
 *Throws:* Nothing.
 ``` cpp
 void resize(size_type sz);
+```
+*Effects:* If `sz < distance(begin(), end())`, erases the last
+`distance(begin(), end()) - sz` elements from the list. Otherwise,
+inserts `sz - distance(begin(), end())` default-inserted elements at the
+end of the list.
+*Requires:* `T` shall be `DefaultInsertable` into `*this`.
+``` cpp
 void resize(size_type sz, const value_type& c);
 ```
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
+inserts `sz - distance(begin(), end())` elements at the end of the list
+such that each new element, `e`, is initialized by a method equivalent
+to calling
+`allocator_traits<allocator_type>::construct(get_allocator(), std::addressof(e), c)`.
+*Requires:* `T` shall be `CopyInsertable` into `*this`.
 ``` cpp
 void clear() noexcept;
 ```
 void splice_after(const_iterator position, forward_list& x);
 void splice_after(const_iterator position, forward_list&& x);
 ```
 *Requires:* `position` is `before_begin()` or is a dereferenceable
+iterator in the range \[`begin()`, `end()`).
+`get_allocator() == x.get_allocator()`. `&x != this`.
 *Effects:* Inserts the contents of `x` after `position`, and `x` becomes
 empty. Pointers and references to the moved elements of `x` now refer to
 those same elements but as members of `*this`. Iterators referring to
 the moved elements will continue to refer to their elements, but they
 ```
 *Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`). The iterator following `i`
 is a dereferenceable iterator in `x`.
+`get_allocator() == x.get_allocator()`.
 *Effects:* Inserts the element following `i` into `*this`, following
 `position`, and removes it from `x`. The result is unchanged if
+`position == i` or `position == ++i`. Pointers and references to `*++i`
 continue to refer to the same element but as a member of `*this`.
+Iterators to `*++i` continue to refer to the same element, but now
+behave as iterators into `*this`, not into `x`.
 *Throws:* Nothing.
 *Complexity:* 𝑂(1)
 *Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`). (`first`, `last`) is a
 valid range in `x`, and all iterators in the range (`first`, `last`) are
 dereferenceable. `position` is not an iterator in the range (`first`,
+`last`). `get_allocator() == x.get_allocator()`.
 *Effects:* Inserts elements in the range (`first`, `last`) after
 `position` and removes the elements from `x`. Pointers and references to
 the moved elements of `x` now refer to those same elements but as
 members of `*this`. Iterators referring to the moved elements will
 template <class Predicate> void remove_if(Predicate pred);
 ```
 *Effects:* Erases all the elements in the list referred by a list
 iterator `i` for which the following conditions hold: `*i == value` (for
+`remove()`), `pred(*i)` is true (for `remove_if()`). Invalidates only
+the iterators and references to the erased elements.
 *Throws:* Nothing unless an exception is thrown by the equality
 comparison or the predicate.
+*Remarks:* Stable ([[algorithm.stable]]).
 *Complexity:* Exactly `distance(begin(), end())` applications of the
 corresponding predicate.
 ``` cpp
 void unique();
 otherwise no applications of the predicate.
 ``` cpp
 void merge(forward_list& x);
 void merge(forward_list&& x);
+template <class Compare> void merge(forward_list& x, Compare comp);
+template <class Compare> void merge(forward_list&& x, Compare comp);
 ```
 *Requires:* `comp` defines a strict weak ordering ([[alg.sorting]]),
 and `*this` and `x` are both sorted according to this ordering.
+`get_allocator() == x.get_allocator()`.
+*Effects:* Merges the two sorted ranges `[begin(), end())` and
+`[x.begin(), x.end())`. `x` is empty after the merge. If an exception is
+thrown other than by a comparison there are no effects. Pointers and
+references to the moved elements of `x` now refer to those same elements
+but as members of `*this`. Iterators referring to the moved elements
+will continue to refer to their elements, but they now behave as
+iterators into `*this`, not into `x`.
+*Remarks:* Stable ([[algorithm.stable]]). The behavior is undefined if
+`this->get_allocator() != x.get_allocator()`.
+*Complexity:* At most
+`distance(begin(), end()) + distance(x.begin(), x.end()) - 1`
+comparisons.
 ``` cpp
 void sort();
 template <class Compare> void sort(Compare comp);
 ```
 *Requires:* `operator<` (for the version with no arguments) or `comp`
 (for the version with a comparison argument) defines a strict weak
 ordering ([[alg.sorting]]).
 *Effects:* Sorts the list according to the `operator<` or the `comp`
+function object. If an exception is thrown the order of the elements in
+`*this` is unspecified. Does not affect the validity of iterators and
+references.
+*Remarks:* Stable ([[algorithm.stable]]).
 *Complexity:* Approximately N log N comparisons, where N is
 `distance(begin(), end())`.
 ``` cpp
     typedef typename allocator_traits<Allocator>::const_pointer     const_pointer;
     typedef std::reverse_iterator<iterator>       reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     // [list.cons], construct/copy/destroy:
+    list() : list(Allocator()) { }
+    explicit list(const Allocator&);
+    explicit list(size_type n, const Allocator& = Allocator());
     list(size_type n, const T& value, const Allocator& = Allocator());
     template <class InputIterator>
       list(InputIterator first, InputIterator last, const Allocator& = Allocator());
     list(const list& x);
     list(list&& x);
 ```
 #### `list` constructors, copy, and assignment <a id="list.cons">[[list.cons]]</a>
 ``` cpp
+explicit list(const Allocator&);
 ```
 *Effects:* Constructs an empty list, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
+explicit list(size_type n, const Allocator& = Allocator());
 ```
+*Effects:* Constructs a `list` with `n` default-inserted elements using
+the specified allocator.
+*Requires:* `T` shall be `DefaultInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 list(size_type n, const T& value,
 *Effects:* Constructs a `list` equal to the range \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
 #### `list` capacity <a id="list.capacity">[[list.capacity]]</a>
 ``` cpp
 void resize(size_type sz);
 ```
+*Effects:* If `size() < sz`, appends `sz - size()` default-inserted
 elements to the sequence. If `sz <= size()`, equivalent to
 ``` cpp
 list<T>::iterator it = begin();
 advance(it, sz);
 erase(it, end());
 ```
+*Requires:* `T` shall be `DefaultInsertable` into `*this`.
 ``` cpp
 void resize(size_type sz, const T& c);
 ```
 references to the erased elements.
 *Throws:* Nothing unless an exception is thrown by `*i == value` or
 `pred(*i) != false`.
+*Remarks:* Stable ([[algorithm.stable]]).
 *Complexity:* Exactly `size()` applications of the corresponding
 predicate.
 ``` cpp
 \[`first + 1`, `last`) for which `*i == *(i-1)` (for the version of
 `unique` with no arguments) or `pred(*i, *(i - 1))` (for the version of
 `unique` with a predicate argument) holds. Invalidates only the
 iterators and references to the erased elements.
+*Throws:* Nothing unless an exception is thrown by `*i == *(i-1)` or
 `pred(*i, *(i - 1))`
 *Complexity:* If the range `[first, last)` is not empty, exactly
 `(last - first) - 1` applications of the corresponding predicate,
 otherwise no applications of the predicate.
 elements of `x` now refer to those same elements but as members of
 `*this`. Iterators referring to the moved elements will continue to
 refer to their elements, but they now behave as iterators into `*this`,
 not into `x`.
+*Remarks:* Stable ([[algorithm.stable]]). If `(&x != this)` the range
+`[x.begin(), x.end())` is empty after the merge. No elements are copied
+by this operation. The behavior is undefined if
+`this->get_allocator() != x.get_allocator()`.
 *Complexity:* At most `size() + x.size() - 1` applications of `comp` if
 `(&x != this)`; otherwise, no applications of `comp` are performed. If
 an exception is thrown other than by a comparison there are no effects.
 *Effects:* Sorts the list according to the `operator<` or a `Compare`
 function object. Does not affect the validity of iterators and
 references.
+*Remarks:* Stable ([[algorithm.stable]]).
 *Complexity:* Approximately N log(N) comparisons, where `N == size()`.
 #### `list` specialized algorithms <a id="list.special">[[list.special]]</a>
     typedef typename allocator_traits<Allocator>::const_pointer     const_pointer;
     typedef std::reverse_iterator<iterator>       reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     // [vector.cons], construct/copy/destroy:
+    vector() : vector(Allocator()) { }
+    explicit vector(const Allocator&);
+    explicit vector(size_type n, const Allocator& = Allocator());
     vector(size_type n, const T& value, const Allocator& = Allocator());
     template <class InputIterator>
       vector(InputIterator first, InputIterator last,
              const Allocator& = Allocator());
     vector(const vector& x);
 ```
 #### `vector` constructors, copy, and assignment <a id="vector.cons">[[vector.cons]]</a>
 ``` cpp
+explicit vector(const Allocator&);
 ```
 *Effects:* Constructs an empty `vector`, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
+explicit vector(size_type n, const Allocator& = Allocator());
 ```
+*Effects:* Constructs a `vector` with `n` default-inserted elements
+using the specified allocator.
+*Requires:* `T` shall be `DefaultInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 vector(size_type n, const T& value,
 is the distance between `first` and `last`) and no reallocations if
 iterators first and last are of forward, bidirectional, or random access
 categories. It makes order `N` calls to the copy constructor of `T` and
 order log(N) reallocations if they are just input iterators.
 #### `vector` capacity <a id="vector.capacity">[[vector.capacity]]</a>
 ``` cpp
 size_type capacity() const noexcept;
 ```
 ``` cpp
 void reserve(size_type n);
 ```
+*Requires:* `T` shall be `MoveInsertable` into `*this`.
 *Effects:* A directive that informs a `vector` of a planned change in
 size, so that it can manage the storage allocation accordingly. After
 `reserve()`, `capacity()` is greater or equal to the argument of
 `reserve` if reallocation happens; and equal to the previous value of
 `capacity()` otherwise. Reallocation happens at this point if and only
 most linear time in the size of the sequence.
 *Throws:* `length_error` if `n > max_size()`.[^4]
 *Remarks:* Reallocation invalidates all the references, pointers, and
+iterators referring to the elements in the sequence. No reallocation
+shall take place during insertions that happen after a call to
+`reserve()` until the time when an insertion would make the size of the
+vector greater than the value of `capacity()`.
 ``` cpp
 void shrink_to_fit();
 ```
+*Requires:* `T` shall be `MoveInsertable` into `*this`.
+*Complexity:* Linear in the size of the sequence.
 *Remarks:* `shrink_to_fit` is a non-binding request to reduce
 `capacity()` to `size()`. The request is non-binding to allow latitude
+for implementation-specific optimizations. If an exception is thrown
+other than by the move constructor of a non-`CopyInsertable` `T` there
+are no effects.
 ``` cpp
 void swap(vector& x);
 ```
 ``` cpp
 void resize(size_type sz);
 ```
+*Effects:* If `sz <= size()`, equivalent to calling `pop_back()`
+`size() - sz` times. If `size() < sz`, appends `sz - size()`
+default-inserted elements to the sequence.
+*Requires:* `T` shall be `MoveInsertable` and `DefaultInsertable` into
+`*this`.
+*Remarks:* If an exception is thrown other than by the move constructor
 of a non-`CopyInsertable` `T` there are no effects.
+``` cpp
+void resize(size_type sz, const T& c);
+```
+*Effects:* If `sz <= size()`, equivalent to calling `pop_back()`
+`size() - sz` times. If `size() < sz`, appends `sz - size()` copies of
+`c` to the sequence.
+*Requires:* `T` shall be `CopyInsertable` into `*this`.
+*Remarks:* If an exception is thrown there are no effects.
 #### `vector` data <a id="vector.data">[[vector.data]]</a>
 ``` cpp
 T*         data() noexcept;
 const T*   data() const noexcept;
 *Remarks:* Causes reallocation if the new size is greater than the old
 capacity. If no reallocation happens, all the iterators and references
 before the insertion point remain valid. If an exception is thrown other
 than by the copy constructor, move constructor, assignment operator, or
 move assignment operator of `T` or by any `InputIterator` operation
+there are no effects. If an exception is thrown while inserting a single
+element at the end and `T` is `CopyInsertable` or
+`is_nothrow_move_constructible<T>::value` is `true`, there are no
+effects. Otherwise, if an exception is thrown by the move constructor of
+a non-`CopyInsertable` `T`, the effects are unspecified.
 *Complexity:* The complexity is linear in the number of elements
 inserted plus the distance to the end of the vector.
 ``` cpp
       reference& operator=(const reference& x) noexcept;
       void flip() noexcept;     // flips the bit
     };
     // construct/copy/destroy:
+    vector() : vector(Allocator()) { }
+    explicit vector(const Allocator&);
+    explicit vector(size_type n, const Allocator& = Allocator());
+    vector(size_type n, const bool& value,
            const Allocator& = Allocator());
     template <class InputIterator>
       vector(InputIterator first, InputIterator last,
              const Allocator& = Allocator());
     vector(const vector<bool,Allocator>& x);
     vector(vector&&, const Allocator&);
     vector(initializer_list<bool>, const Allocator& = Allocator()));
    ~vector();
     vector<bool,Allocator>& operator=(const vector<bool,Allocator>& x);
     vector<bool,Allocator>& operator=(vector<bool,Allocator>&& x);
+    vector& operator=(initializer_list<bool>);
     template <class InputIterator>
       void assign(InputIterator first, InputIterator last);
     void assign(size_type n, const bool& t);
+    void assign(initializer_list<bool>);
     allocator_type get_allocator() const noexcept;
     // iterators:
     iterator               begin() noexcept;
     const_iterator         begin() const noexcept;
     const_reference front() const;
     reference       back();
     const_reference back() const;
     // modifiers:
+    template <class... Args> void emplace_back(Args&&... args);
     void push_back(const bool& x);
     void pop_back();
+    template <class... Args> iterator emplace(const_iterator position, Args&&... args);
     iterator insert(const_iterator position, const bool& x);
     iterator insert (const_iterator position, size_type n, const bool& x);
     template <class InputIterator>
         iterator insert(const_iterator position,
                         InputIterator first, InputIterator last);
 ``` cpp
 template <class Allocator> struct hash<vector<bool, Allocator> >;
 ```
+The template specialization shall meet the requirements of class
+template `hash` ([[unord.hash]]).

Diff to HTML by rtfpessoa