[sequences] - C++17 → C++20

Files changed (1) hide show

tmp/tmpbj3pzuhg/{from.md → to.md} +684 -608

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

@@ -4,35 +4,47 @@
 The headers `<array>`, `<deque>`, `<forward_list>`, `<list>`, and
 `<vector>` define class templates that meet the requirements for
 sequence containers.
 ### Header `<array>` synopsis <a id="array.syn">[[array.syn]]</a>
 ``` cpp
-#include <initializer_list>
 namespace std {
   // [array], class template array
   template<class T, size_t N> struct array;
   template<class T, size_t N>
-    bool operator==(const array<T, N>& x, const array<T, N>& y);
-  template <class T, size_t N>
-    bool operator!=(const array<T, N>& x, const array<T, N>& y);
-  template <class T, size_t N>
-    bool operator< (const array<T, N>& x, const array<T, N>& y);
   template<class T, size_t N>
- bool operator> (const array<T, N>& x, const array<T, N>& y);
   template<class T, size_t N>
- bool operator<=(const array<T, N>& x, const array<T, N>& y);
   template<class T, size_t N>
- bool operator>=(const array<T, N>& x, const array<T, N>& y);
   template<class T, size_t N>
- void swap(array<T, N>& x, array<T, N>& y) noexcept(noexcept(x.swap(y)));
- template <class T> class tuple_size;
-  template <size_t I, class T> class tuple_element;
   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>
@@ -47,124 +59,136 @@ namespace std {
 ```
 ### Header `<deque>` synopsis <a id="deque.syn">[[deque.syn]]</a>
 ``` cpp
-#include <initializer_list>
 namespace std {
   // [deque], class template deque
   template<class T, class Allocator = allocator<T>> class deque;
   template<class T, class Allocator>
     bool operator==(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
   template<class T, class Allocator>
- bool operator< (const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
   template<class T, class Allocator>
     void swap(deque<T, Allocator>& x, deque<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
   namespace pmr {
     template<class T>
       using deque = std::deque<T, polymorphic_allocator<T>>;
   }
 }
 ```
-### Header `<forward_list>` synopsis <a id="forward_list.syn">[[forward_list.syn]]</a>
 ``` cpp
-#include <initializer_list>
 namespace std {
   // [forwardlist], class template forward_list
   template<class T, class Allocator = allocator<T>> class forward_list;
   template<class T, class Allocator>
     bool operator==(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
   template<class T, class Allocator>
- bool operator< (const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
   template<class T, class Allocator>
     void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
   namespace pmr {
     template<class T>
       using forward_list = std::forward_list<T, polymorphic_allocator<T>>;
   }
 }
 ```
 ### Header `<list>` synopsis <a id="list.syn">[[list.syn]]</a>
 ``` cpp
-#include <initializer_list>
 namespace std {
   // [list], class template list
   template<class T, class Allocator = allocator<T>> class list;
   template<class T, class Allocator>
     bool operator==(const list<T, Allocator>& x, const list<T, Allocator>& y);
   template<class T, class Allocator>
- bool operator< (const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const list<T, Allocator>& x, const list<T, Allocator>& y);
   template<class T, class Allocator>
     void swap(list<T, Allocator>& x, list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
   namespace pmr {
     template<class T>
       using list = std::list<T, polymorphic_allocator<T>>;
   }
 }
 ```
 ### Header `<vector>` synopsis <a id="vector.syn">[[vector.syn]]</a>
 ``` cpp
-#include <initializer_list>
 namespace std {
   // [vector], class template vector
   template<class T, class Allocator = allocator<T>> class vector;
   template<class T, class Allocator>
-    bool operator==(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
   template<class T, class Allocator>
- bool operator< (const vector<T, Allocator>& x, const vector<T, Allocator>& y);
   template<class T, class Allocator>
- bool operator!=(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    void swap(vector<T, Allocator>& x, vector<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
   // [vector.bool], class vector<bool>
   template<class Allocator> class vector<bool, Allocator>;
   // hash support
   template<class T> struct hash;
@@ -177,35 +201,44 @@ namespace std {
 }
 ```
 ### Class template `array` <a id="array">[[array]]</a>
-#### Class template `array` overview <a id="array.overview">[[array.overview]]</a>
 The header `<array>` defines a class template for storing fixed-size
-sequences of objects. An `array` is a contiguous container (
-[[container.requirements.general]]). An instance of `array<T, N>` stores
 `N` elements of type `T`, so that `size() == N` is an invariant.
-An `array` is an aggregate ([[dcl.init.aggr]]) that can be
 list-initialized with up to `N` elements whose types are convertible to
 `T`.
-An `array` satisfies all of the requirements of a container and of a
-reversible container ([[container.requirements]]), except that a
-default constructed `array` object is not empty and that `swap` does not
-have constant complexity. An `array` satisfies some of the requirements
-of a sequence container ([[sequence.reqmts]]). Descriptions are
-provided here only for operations on `array` that are not described in
-one of these tables and for operations where there is additional
-semantic information.
 ``` cpp
 namespace std {
   template<class T, size_t N>
   struct array {
-    // types:
     using value_type             = T;
     using pointer                = T*;
     using const_pointer          = const T*;
     using reference              = T&;
     using const_reference        = const T&;
@@ -216,14 +249,14 @@ namespace std {
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
     // no explicit construct/copy/destroy for aggregate type
-    void fill(const T& u);
-    void swap(array&) noexcept(is_nothrow_swappable_v<T>);
-    // iterators:
     constexpr iterator               begin() noexcept;
     constexpr const_iterator         begin() const noexcept;
     constexpr iterator               end() noexcept;
     constexpr const_iterator         end() const noexcept;
@@ -235,16 +268,16 @@ namespace std {
     constexpr const_iterator         cbegin() const noexcept;
     constexpr const_iterator         cend() const noexcept;
     constexpr const_reverse_iterator crbegin() const noexcept;
     constexpr const_reverse_iterator crend() const noexcept;
-    // capacity:
-    constexpr bool empty() const noexcept;
     constexpr size_type size() const noexcept;
     constexpr size_type max_size() const noexcept;
-    // element access:
     constexpr reference       operator[](size_type n);
     constexpr const_reference operator[](size_type n) const;
     constexpr reference       at(size_type n);
     constexpr const_reference at(size_type n) const;
     constexpr reference       front();
@@ -259,83 +292,75 @@ namespace std {
   template<class T, class... U>
     array(T, U...) -> array<T, 1 + sizeof...(U)>;
 }
 ```
-#### `array` constructors, copy, and assignment <a id="array.cons">[[array.cons]]</a>
-The conditions for an aggregate ([[dcl.init.aggr]]) shall be met. Class
 `array` relies on the implicitly-declared special member functions (
-[[class.ctor]], [[class.dtor]], and [[class.copy]]) to conform to the
-container requirements table in  [[container.requirements]]. In addition
-to the requirements specified in the container requirements table, the
-implicit move constructor and move assignment operator for `array`
-require that `T` be `MoveConstructible` or `MoveAssignable`,
-respectively.
 ``` cpp
 template<class T, class... U>
   array(T, U...) -> array<T, 1 + sizeof...(U)>;
 ```
-*Requires:* `(is_same_v<T, U> && ...)` is `true`. Otherwise the program
-is ill-formed.
-#### `array` specialized algorithms <a id="array.special">[[array.special]]</a>
 ``` cpp
-template <class T, size_t N>
-  void swap(array<T, N>& x, array<T, N>& y) noexcept(noexcept(x.swap(y)));
-```
-*Remarks:* This function shall not participate in overload resolution
-unless `N == 0` or `is_swappable_v<T>` is `true`.
-*Effects:* As if by `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>
 ``` cpp
 constexpr T* data() noexcept;
 constexpr const T* data() const noexcept;
 ```
-*Returns:* A pointer such that `data() == addressof(front())`, and
-\[`data()`, `data() + size()`) is a valid range.
-#### `array::fill` <a id="array.fill">[[array.fill]]</a>
 ``` cpp
-void fill(const T& u);
 ```
 *Effects:* As if by `fill_n(begin(), N, u)`.
-#### `array::swap` <a id="array.swap">[[array.swap]]</a>
 ``` cpp
-void swap(array& y) noexcept(is_nothrow_swappable_v<T>);
 ```
 *Effects:* Equivalent to `swap_ranges(begin(), end(), y.begin())`.
 [*Note 1*: 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. — *end note*]
-#### Zero sized arrays <a id="array.zero">[[array.zero]]</a>
 `array` shall provide support for the special case `N == 0`.
 In the case that `N == 0`, `begin() == end() ==` unique value. The
 return value of `data()` is unspecified.
@@ -344,24 +369,51 @@ The effect of calling `front()` or `back()` for a zero-sized array is
 undefined.
 Member function `swap()` shall have a non-throwing exception
 specification.
-#### 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;
 template<size_t I, class T, size_t N>
@@ -370,41 +422,40 @@ template <size_t I, class T, size_t N>
   constexpr const T& get(const array<T, N>& a) noexcept;
 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 reference to the `I`th element of `a`, where indexing is
 zero-based.
 ### Class template `deque` <a id="deque">[[deque]]</a>
-#### Class template `deque` overview <a id="deque.overview">[[deque.overview]]</a>
 A `deque` is a sequence container that supports random access iterators
-([[random.access.iterators]]). In addition, it supports constant time
 insert and erase operations at the beginning or the end; insert and
 erase in the middle take linear time. That is, a deque is especially
 optimized for pushing and popping elements at the beginning and end.
 Storage management is handled automatically.
-A `deque` satisfies all of the requirements of a container, of a
-reversible container (given in tables in  [[container.requirements]]),
-of a sequence container, including the optional sequence container
-requirements ([[sequence.reqmts]]), and of an allocator-aware container
-(Table  [[tab:containers.allocatoraware]]). Descriptions are provided
-here only for operations on `deque` that are not described in one of
-these tables or for operations where there is additional semantic
-information.
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class deque {
   public:
-    // types:
     using value_type             = T;
     using allocator_type         = Allocator;
     using pointer                = typename allocator_traits<Allocator>::pointer;
     using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
@@ -438,11 +489,11 @@ namespace std {
       void assign(InputIterator first, InputIterator last);
     void assign(size_type n, const T& t);
     void assign(initializer_list<T>);
     allocator_type get_allocator() const noexcept;
-    // iterators:
     iterator               begin() noexcept;
     const_iterator         begin() const noexcept;
     iterator               end() noexcept;
     const_iterator         end() const noexcept;
     reverse_iterator       rbegin() noexcept;
@@ -454,18 +505,18 @@ namespace std {
     const_iterator         cend() const noexcept;
     const_reverse_iterator crbegin() const noexcept;
     const_reverse_iterator crend() const noexcept;
     // [deque.capacity], capacity
-    bool empty() const noexcept;
     size_type size() const noexcept;
     size_type max_size() const noexcept;
     void      resize(size_type sz);
     void      resize(size_type sz, const T& c);
     void      shrink_to_fit();
-    // element access:
     reference       operator[](size_type n);
     const_reference operator[](size_type n) const;
     reference       at(size_type n);
     const_reference at(size_type n) const;
     reference       front();
@@ -498,36 +549,22 @@ namespace std {
     void     swap(deque&)
       noexcept(allocator_traits<Allocator>::is_always_equal::value);
     void     clear() noexcept;
   };
-  template<class InputIterator,
-           class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
     deque(InputIterator, InputIterator, Allocator = Allocator())
-      -> deque<typename iterator_traits<InputIterator>::value_type, Allocator>;
- template <class T, class Allocator>
-    bool operator==(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator< (const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
-  // [deque.special], specialized algorithms
   template<class T, class Allocator>
     void swap(deque<T, Allocator>& x, deque<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
-#### `deque` constructors, copy, and assignment <a id="deque.cons">[[deque.cons]]</a>
 ``` cpp
 explicit deque(const Allocator&);
 ```
@@ -540,22 +577,22 @@ 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, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `deque` with `n` copies of `value`, using the
 specified allocator.
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
@@ -565,55 +602,57 @@ template <class InputIterator>
 *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()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, 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()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, 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`.
 *Effects:* `shrink_to_fit` is a non-binding request to reduce memory use
 but does not change the size of the sequence.
 [*Note 1*: The request is non-binding to allow latitude for
 implementation-specific optimizations. — *end note*]
-If an exception is thrown other than by the move constructor of a
-non-`CopyInsertable` `T` there are no effects.
-*Complexity:* Linear in the size of the sequence.
-*Remarks:* `shrink_to_fit` invalidates all the references, pointers, and
-iterators referring to the elements in the sequence as well as the
-past-the-end iterator.
-#### `deque` modifiers <a id="deque.modifiers">[[deque.modifiers]]</a>
 ``` cpp
 iterator insert(const_iterator position, const T& x);
 iterator insert(const_iterator position, T&& x);
 iterator insert(const_iterator position, size_type n, const T& x);
@@ -638,16 +677,16 @@ 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
 constructor of `T`.
 ``` cpp
 iterator erase(const_iterator position);
@@ -672,48 +711,68 @@ operations. — *end note*]
 as the number of elements erased, but the number of calls to the
 assignment operator of `T` is no more than the lesser of the number of
 elements before the erased elements and the number of elements after the
 erased elements.
-*Throws:* Nothing unless an exception is thrown by the copy constructor,
-move constructor, assignment operator, or move assignment operator of
-`T`.
-#### `deque` specialized algorithms <a id="deque.special">[[deque.special]]</a>
 ``` cpp
-template <class T, class Allocator>
- void swap(deque<T, Allocator>& x, deque<T, Allocator>& y)
- noexcept(noexcept(x.swap(y)));
 ```
-*Effects:* As if by `x.swap(y)`.
 ### Class template `forward_list` <a id="forwardlist">[[forwardlist]]</a>
-#### Class template `forward_list` overview <a id="forwardlist.overview">[[forwardlist.overview]]</a>
 A `forward_list` is a container that supports forward iterators and
 allows constant time insert and erase operations anywhere within the
 sequence, with storage management handled automatically. Fast random
 access to list elements is not supported.
 [*Note 1*: It is intended that `forward_list` have zero space or time
 overhead relative to a hand-written C-style singly linked list. Features
 that would conflict with that goal have been omitted. — *end note*]
-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.
 [*Note 2*: 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
@@ -722,11 +781,11 @@ be open at the beginning. — *end note*]
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class forward_list {
   public:
-    // types:
     using value_type      = T;
     using allocator_type  = Allocator;
     using pointer         = typename allocator_traits<Allocator>::pointer;
     using const_pointer   = typename allocator_traits<Allocator>::const_pointer;
     using reference       = value_type&;
@@ -738,15 +797,13 @@ namespace std {
     // [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(const forward_list& x);
     forward_list(forward_list&& x);
     forward_list(const forward_list& x, const Allocator&);
     forward_list(forward_list&& x, const Allocator&);
     forward_list(initializer_list<T>, const Allocator& = Allocator());
@@ -771,12 +828,12 @@ namespace std {
     const_iterator cbegin() const noexcept;
     const_iterator cbefore_begin() const noexcept;
     const_iterator cend() const noexcept;
-    // capacity:
-    bool empty() const noexcept;
     size_type max_size() const noexcept;
     // [forwardlist.access], element access
     reference front();
     const_reference front() const;
@@ -806,24 +863,22 @@ namespace std {
     void clear() noexcept;
     // [forwardlist.ops], forward_list operations
     void splice_after(const_iterator position, forward_list& x);
     void splice_after(const_iterator position, forward_list&& x);
-    void splice_after(const_iterator position, forward_list& x,
- const_iterator i);
-    void splice_after(const_iterator position, forward_list&& x,
-                      const_iterator i);
     void splice_after(const_iterator position, forward_list& x,
                       const_iterator first, const_iterator last);
     void splice_after(const_iterator position, forward_list&& x,
                       const_iterator first, const_iterator last);
- void remove(const T& value);
-    template <class Predicate> void remove_if(Predicate pred);
- void unique();
-    template <class BinaryPredicate> void unique(BinaryPredicate binary_pred);
     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);
@@ -832,42 +887,28 @@ namespace std {
     template<class Compare> void sort(Compare comp);
     void reverse() noexcept;
   };
-  template<class InputIterator,
-           class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
     forward_list(InputIterator, InputIterator, Allocator = Allocator())
-      -> forward_list<typename iterator_traits<InputIterator>::value_type, Allocator>;
- template <class T, class Allocator>
-    bool operator==(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator< (const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
-  // [forwardlist.spec], specialized algorithms
   template<class T, class Allocator>
     void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
 An incomplete type `T` may be used when instantiating `forward_list` if
-the allocator satisfies the allocator completeness requirements (
-[[allocator.requirements.completeness]]). `T` shall be complete before
 any member of the resulting specialization of `forward_list` is
 referenced.
-#### `forward_list` constructors, copy, assignment <a id="forwardlist.cons">[[forwardlist.cons]]</a>
 ``` cpp
 explicit forward_list(const Allocator&);
 ```
@@ -878,26 +919,26 @@ allocator.
 ``` 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 with `n` copies of `value`
 using the specified allocator.
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
   forward_list(InputIterator first, InputIterator last, const Allocator& = Allocator());
@@ -906,11 +947,11 @@ template <class InputIterator>
 *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;
 const_iterator cbefore_begin() const noexcept;
@@ -922,20 +963,20 @@ equal to the iterator returned by `begin()`.
 *Effects:* `cbefore_begin()` is equivalent to
 `const_cast<forward_list const&>(*this).before_begin()`.
 *Remarks:* `before_begin() == end()` shall equal `false`.
-#### `forward_list` element access <a id="forwardlist.access">[[forwardlist.access]]</a>
 ``` cpp
 reference front();
 const_reference front() const;
 ```
 *Returns:* `*begin()`
-#### `forward_list` modifiers <a id="forwardlist.modifiers">[[forwardlist.modifiers]]</a>
 None of the overloads of `insert_after` shall affect the validity of
 iterators and references, and `erase_after` shall invalidate only
 iterators and references to the erased elements. If an exception is
 thrown during `insert_after` there shall be no effect. Inserting `n`
@@ -967,22 +1008,22 @@ void pop_front();
 ``` cpp
 iterator insert_after(const_iterator position, const T& x);
 iterator insert_after(const_iterator position, T&& x);
 ```
-*Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
 *Effects:* Inserts a copy of `x` after `position`.
 *Returns:* An iterator pointing to the copy of `x`.
 ``` cpp
 iterator insert_after(const_iterator position, size_type n, const T& x);
 ```
-*Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
 *Effects:* Inserts `n` copies of `x` after `position`.
 *Returns:* An iterator pointing to the last inserted copy of `x` or
@@ -991,13 +1032,13 @@ iterator in the range \[`begin()`, `end()`).
 ``` cpp
 template<class InputIterator>
   iterator insert_after(const_iterator position, InputIterator first, InputIterator last);
 ```
-*Requires:* `position` is `before_begin()` or is a dereferenceable
-iterator in the range \[`begin()`, `end()`). `first` and `last` are not
-iterators in `*this`.
 *Effects:* Inserts copies of elements in \[`first`, `last`) after
 `position`.
 *Returns:* An iterator pointing to the last inserted element or
@@ -1015,11 +1056,11 @@ iterator insert_after(const_iterator position, initializer_list<T> il);
 ``` cpp
 template<class... Args>
   iterator emplace_after(const_iterator position, Args&&... args);
 ```
-*Requires:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
 *Effects:* Inserts an object of type `value_type` constructed with
 `value_type(std::forward<Args>(args)...)` after `position`.
@@ -1027,11 +1068,11 @@ iterator in the range \[`begin()`, `end()`).
 ``` cpp
 iterator erase_after(const_iterator position);
 ```
-*Requires:* The iterator following `position` is dereferenceable.
 *Effects:* Erases the element pointed to by the iterator following
 `position`.
 *Returns:* An iterator pointing to the element following the one that
@@ -1041,11 +1082,11 @@ was erased, or `end()` if no such element exists.
 ``` cpp
 iterator erase_after(const_iterator position, const_iterator last);
 ```
-*Requires:* All iterators in the range (`position`, `last`) are
 dereferenceable.
 *Effects:* Erases the elements in the range (`position`, `last`).
 *Returns:* `last`.
@@ -1054,46 +1095,52 @@ dereferenceable.
 ``` 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())` copies of `c` at the end of the
 list.
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
 ``` cpp
 void clear() noexcept;
 ```
 *Effects:* Erases all elements in the range \[`begin()`, `end()`).
 *Remarks:* Does not invalidate past-the-end iterators.
-#### `forward_list` operations <a id="forwardlist.ops">[[forwardlist.ops]]</a>
 ``` cpp
 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
@@ -1106,14 +1153,14 @@ now behave as iterators into `*this`, not into `x`.
 ``` cpp
 void splice_after(const_iterator position, forward_list& x, const_iterator i);
 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`.
-`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`.
@@ -1129,15 +1176,15 @@ void splice_after(const_iterator position, forward_list& x,
                   const_iterator first, const_iterator last);
 void splice_after(const_iterator position, forward_list&& x,
                   const_iterator first, const_iterator last);
 ```
-*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
@@ -1145,39 +1192,43 @@ continue to refer to their elements, but they now behave as iterators
 into `*this`, not into `x`.
 *Complexity:* 𝑂(`distance(first, last)`)
 ``` cpp
-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()`). 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();
-template <class BinaryPredicate> void unique(BinaryPredicate pred);
 ```
 *Effects:* Erases all but the first element from every consecutive group
 of equal elements referred to by the iterator `i` in the range
 \[`first + 1`, `last`) for which `*i == *(i-1)` (for the version with no
 arguments) or `pred(*i, *(i - 1))` (for the version with a predicate
 argument) holds. 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:* If the range \[`first`, `last`) is not empty, exactly
 `(last - first) - 1` applications of the corresponding predicate,
@@ -1188,44 +1239,40 @@ 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
-`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
@@ -1235,48 +1282,55 @@ void reverse() noexcept;
 *Effects:* Reverses the order of the elements in the list. Does not
 affect the validity of iterators and references.
 *Complexity:* Linear time.
-#### `forward_list` specialized algorithms <a id="forwardlist.spec">[[forwardlist.spec]]</a>
 ``` cpp
-template <class T, class Allocator>
- void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y)
- noexcept(noexcept(x.swap(y)));
 ```
-*Effects:* As if by `x.swap(y)`.
 ### Class template `list` <a id="list">[[list]]</a>
-#### Class template `list` overview <a id="list.overview">[[list.overview]]</a>
 A `list` is a sequence container that supports bidirectional iterators
 and allows constant time insert and erase operations anywhere within the
-sequence, with storage management handled automatically. Unlike
-vectors ([[vector]]) and deques ([[deque]]), fast random access to
-list elements is not supported, but many algorithms only need sequential
-access anyway.
-A `list` satisfies all of the requirements of a container, of a
-reversible container (given in two tables in
-[[container.requirements]]), of a sequence container, including most of
-the optional sequence container requirements ([[sequence.reqmts]]), and
-of an allocator-aware container (Table
-[[tab:containers.allocatoraware]]). The exceptions are the `operator[]`
-and `at` member functions, which are not provided.[^2] Descriptions are
-provided here only for operations on `list` that are not described in
-one of these tables or for operations where there is additional semantic
 information.
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class list {
   public:
-    // types:
     using value_type             = T;
     using allocator_type         = Allocator;
     using pointer                = typename allocator_traits<Allocator>::pointer;
     using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
@@ -1309,11 +1363,11 @@ namespace std {
       void assign(InputIterator first, InputIterator last);
     void assign(size_type n, const T& t);
     void assign(initializer_list<T>);
     allocator_type get_allocator() const noexcept;
-    // iterators:
     iterator               begin() noexcept;
     const_iterator         begin() const noexcept;
     iterator               end() noexcept;
     const_iterator         end() const noexcept;
     reverse_iterator       rbegin() noexcept;
@@ -1325,17 +1379,17 @@ namespace std {
     const_iterator         cend() const noexcept;
     const_reverse_iterator crbegin() const noexcept;
     const_reverse_iterator crend() const noexcept;
     // [list.capacity], capacity
-    bool empty() const noexcept;
     size_type size() const noexcept;
     size_type max_size() const noexcept;
     void      resize(size_type sz);
     void      resize(size_type sz, const T& c);
-    // element access:
     reference       front();
     const_reference front() const;
     reference       back();
     const_reference back() const;
@@ -1352,36 +1406,32 @@ namespace std {
     template<class... Args> iterator emplace(const_iterator position, Args&&... args);
     iterator insert(const_iterator position, const T& x);
     iterator insert(const_iterator position, T&& x);
     iterator insert(const_iterator position, size_type n, const T& x);
     template<class InputIterator>
-      iterator insert(const_iterator position, InputIterator first,
-                      InputIterator last);
     iterator insert(const_iterator position, initializer_list<T> il);
     iterator erase(const_iterator position);
     iterator erase(const_iterator position, const_iterator last);
-    void     swap(list&)
-      noexcept(allocator_traits<Allocator>::is_always_equal::value);
     void     clear() noexcept;
     // [list.ops], list operations
     void splice(const_iterator position, list& x);
     void splice(const_iterator position, list&& x);
     void splice(const_iterator position, list& x, const_iterator i);
     void splice(const_iterator position, list&& x, const_iterator i);
-    void splice(const_iterator position, list& x,
- const_iterator first, const_iterator last);
-    void splice(const_iterator position, list&& x,
-                const_iterator first, const_iterator last);
- void remove(const T& value);
-    template <class Predicate> void remove_if(Predicate pred);
- void unique();
     template<class BinaryPredicate>
- void unique(BinaryPredicate binary_pred);
     void merge(list& x);
     void merge(list&& x);
     template<class Compare> void merge(list& x, Compare comp);
     template<class Compare> void merge(list&& x, Compare comp);
@@ -1390,41 +1440,27 @@ namespace std {
     template<class Compare> void sort(Compare comp);
     void reverse() noexcept;
   };
-  template<class InputIterator,
-           class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
     list(InputIterator, InputIterator, Allocator = Allocator())
-      -> list<typename iterator_traits<InputIterator>::value_type, Allocator>;
- template <class T, class Allocator>
-    bool operator==(const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator< (const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const list<T, Allocator>& x, const list<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const list<T, Allocator>& x, const list<T, Allocator>& y);
-  // [list.special], specialized algorithms
   template<class T, class Allocator>
     void swap(list<T, Allocator>& x, list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
 An incomplete type `T` may be used when instantiating `list` if the
-allocator satisfies the allocator completeness requirements (
-[[allocator.requirements.completeness]]). `T` shall be complete before
 any member of the resulting specialization of `list` is referenced.
-#### `list` constructors, copy, and assignment <a id="list.cons">[[list.cons]]</a>
 ``` cpp
 explicit list(const Allocator&);
 ```
@@ -1434,26 +1470,26 @@ explicit list(const Allocator&);
 ``` 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, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `list` with `n` copies of `value`, using the
 specified allocator.
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
   list(InputIterator first, InputIterator last, const Allocator& = Allocator());
@@ -1461,31 +1497,33 @@ template <class InputIterator>
 *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);
 ```
 *Effects:* As if by:
 ``` cpp
 if (sz > size())
   insert(end(), sz-size(), c);
@@ -1496,13 +1534,11 @@ else if (sz < size()) {
 }
 else
   ;                 // do nothing
 ```
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
-#### `list` modifiers <a id="list.modifiers">[[list.modifiers]]</a>
 ``` cpp
 iterator insert(const_iterator position, const T& x);
 iterator insert(const_iterator position, T&& x);
 iterator insert(const_iterator position, size_type n, const T& x);
@@ -1546,14 +1582,18 @@ elements.
 *Complexity:* Erasing a single element is a constant time operation with
 a single call to the destructor of `T`. Erasing a range in a list is
 linear time in the size of the range and the number of calls to the
 destructor of type `T` is exactly equal to the size of the range.
-#### `list` operations <a id="list.ops">[[list.ops]]</a>
 Since lists allow fast insertion and erasing from the middle of a list,
-certain operations are provided specifically for them.[^3]
 `list` provides three splice operations that destructively move elements
 from one list to another. The behavior of splice operations is undefined
 if `get_allocator() !=
 x.get_allocator()`.
@@ -1561,11 +1601,11 @@ x.get_allocator()`.
 ``` cpp
 void splice(const_iterator position, list& x);
 void splice(const_iterator position, list&& x);
 ```
-*Requires:* `&x != this`.
 *Effects:* Inserts the contents of `x` before `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
@@ -1578,11 +1618,11 @@ now behave as iterators into `*this`, not into `x`.
 ``` cpp
 void splice(const_iterator position, list& x, const_iterator i);
 void splice(const_iterator position, list&& x, const_iterator i);
 ```
-*Requires:* `i` is a valid dereferenceable iterator of `x`.
 *Effects:* Inserts an element pointed to by `i` from list `x` before
 `position` and removes the element from `x`. The result is unchanged if
 `position == i` or `position == ++i`. Pointers and references to `*i`
 continue to refer to this same element but as a member of `*this`.
@@ -1598,55 +1638,59 @@ void splice(const_iterator position, list& x, const_iterator first,
             const_iterator last);
 void splice(const_iterator position, list&& x, const_iterator first,
             const_iterator last);
 ```
-*Requires:* `[first, last)` is a valid range in `x`. The program has
-undefined behavior if `position` is an iterator in the range \[`first`,
-`last`).
 *Effects:* Inserts elements in the range \[`first`, `last`) before
 `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
 continue to refer to their elements, but they now behave as iterators
 into `*this`, not into `x`.
 *Throws:* Nothing.
-*Complexity:* Constant time if `&x == this`; otherwise, linear time.
 ``` cpp
-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, pred(*i) != false`. Invalidates only the iterators and
-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
-void unique();
-template <class BinaryPredicate> void unique(BinaryPredicate binary_pred);
 ```
 *Effects:* Erases all but the first element from every consecutive group
 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 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,
@@ -1657,33 +1701,34 @@ void merge(list& x);
 void merge(list&& x);
 template<class Compare> void merge(list& x, Compare comp);
 template<class Compare> void merge(list&& x, Compare comp);
 ```
-*Requires:* `comp` shall define a strict weak
-ordering ([[alg.sorting]]), and both the list and the argument list
-shall be sorted according to this ordering.
-*Effects:* If `(&x == this)` does nothing; otherwise, merges the two
-sorted ranges `[begin(), end())` and `[x.begin(), x.end())`. The result
-is a range in which the elements will be sorted in non-decreasing order
-according to the ordering defined by `comp`; that is, for every iterator
-`i`, in the range other than the first, the condition
 `comp(*i, *(i - 1))` will be `false`. 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]]). 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
-`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.
 ``` cpp
 void reverse() noexcept;
 ```
@@ -1695,59 +1740,68 @@ affect the validity of iterators and references.
 ``` cpp
 void sort();
 template<class Compare> void sort(Compare comp);
 ```
-*Requires:* `operator<` (for the first version) or `comp` (for the
-second version) shall define a strict weak ordering ([[alg.sorting]]).
 *Effects:* Sorts the list according to the `operator<` or a `Compare`
 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 == size()`.
-#### `list` specialized algorithms <a id="list.special">[[list.special]]</a>
 ``` cpp
-template <class T, class Allocator>
- void swap(list<T, Allocator>& x, list<T, Allocator>& y)
- noexcept(noexcept(x.swap(y)));
 ```
-*Effects:* As if by `x.swap(y)`.
 ### Class template `vector` <a id="vector">[[vector]]</a>
-#### Class template `vector` overview <a id="vector.overview">[[vector.overview]]</a>
 A `vector` is a sequence container that supports (amortized) constant
 time insert and erase operations at the end; insert and erase in the
 middle take linear time. Storage management is handled automatically,
 though hints can be given to improve efficiency.
-A `vector` satisfies all of the requirements of a container and of a
 reversible container (given in two tables in
 [[container.requirements]]), of a sequence container, including most of
-the optional sequence container requirements ([[sequence.reqmts]]), of
-an allocator-aware container (Table  [[tab:containers.allocatoraware]]),
-and, for an element type other than `bool`, of a contiguous container (
-[[container.requirements.general]]). The exceptions are the
-`push_front`, `pop_front`, and `emplace_front` member functions, which
-are not provided. Descriptions are provided here only for operations on
-`vector` that are not described in one of these tables or for operations
-where there is additional semantic information.
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class vector {
   public:
-    // types:
     using value_type             = T;
     using allocator_type         = Allocator;
     using pointer                = typename allocator_traits<Allocator>::pointer;
     using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
@@ -1758,159 +1812,146 @@ namespace std {
     using const_iterator         = implementation-defined  // type of vector::const_iterator; // see [container.requirements]
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
     // [vector.cons], construct/copy/destroy
-    vector() noexcept(noexcept(Allocator())) : vector(Allocator()) { }
-    explicit vector(const Allocator&) noexcept;
-    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(vector&&) noexcept;
-    vector(const vector&, const Allocator&);
-    vector(vector&&, const Allocator&);
-    vector(initializer_list<T>, const Allocator& = Allocator());
-    ~vector();
-    vector& operator=(const vector& x);
-    vector& operator=(vector&& x)
       noexcept(allocator_traits<Allocator>::propagate_on_container_move_assignment::value ||
                allocator_traits<Allocator>::is_always_equal::value);
-    vector& operator=(initializer_list<T>);
     template<class InputIterator>
-      void assign(InputIterator first, InputIterator last);
-    void assign(size_type n, const T& u);
-    void assign(initializer_list<T>);
-    allocator_type get_allocator() const noexcept;
-    // iterators:
-    iterator               begin() noexcept;
-    const_iterator         begin() const noexcept;
-    iterator               end() noexcept;
-    const_iterator         end() const noexcept;
-    reverse_iterator       rbegin() noexcept;
-    const_reverse_iterator rbegin() const noexcept;
-    reverse_iterator       rend() noexcept;
-    const_reverse_iterator rend() const noexcept;
-    const_iterator         cbegin() const noexcept;
-    const_iterator         cend() const noexcept;
-    const_reverse_iterator crbegin() const noexcept;
-    const_reverse_iterator crend() const noexcept;
     // [vector.capacity], capacity
-    bool empty() const noexcept;
-    size_type size() const noexcept;
-    size_type max_size() const noexcept;
-    size_type capacity() const noexcept;
-    void      resize(size_type sz);
-    void      resize(size_type sz, const T& c);
-    void      reserve(size_type n);
-    void      shrink_to_fit();
-    // 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;
     // [vector.data], data access
-    T*       data() noexcept;
-    const T* data() const noexcept;
     // [vector.modifiers], modifiers
-    template <class... Args> reference emplace_back(Args&&... args);
-    void push_back(const T& x);
-    void push_back(T&& x);
-    void pop_back();
-    template <class... Args> iterator emplace(const_iterator position, Args&&... args);
-    iterator insert(const_iterator position, const T& x);
-    iterator insert(const_iterator position, T&& x);
-    iterator insert(const_iterator position, size_type n, const T& x);
     template<class InputIterator>
-      iterator insert(const_iterator position, InputIterator first, InputIterator last);
-    iterator insert(const_iterator position, initializer_list<T> il);
-    iterator erase(const_iterator position);
-    iterator erase(const_iterator first, const_iterator last);
- void     swap(vector&)
       noexcept(allocator_traits<Allocator>::propagate_on_container_swap::value ||
                allocator_traits<Allocator>::is_always_equal::value);
-    void     clear() noexcept;
   };
-  template<class InputIterator,
-           class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
     vector(InputIterator, InputIterator, Allocator = Allocator())
-      -> vector<typename iterator_traits<InputIterator>::value_type, Allocator>;
   template<class T, class Allocator>
- bool operator==(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator< (const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator!=(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator> (const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator>=(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  template <class T, class Allocator>
-    bool operator<=(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
-  // [vector.special], specialized algorithms
-  template <class T, class Allocator>
-    void swap(vector<T, Allocator>& x, vector<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
 An incomplete type `T` may be used when instantiating `vector` if the
-allocator satisfies the allocator completeness requirements (
-[[allocator.requirements.completeness]]). `T` shall be complete before
 any member of the resulting specialization of `vector` is referenced.
-#### `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,
                  const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `vector` with `n` copies of `value`, using the
 specified allocator.
-*Requires:* `T` shall be `CopyInsertable` into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
-  vector(InputIterator first, InputIterator last,
                    const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `vector` equal to the range \[`first`, `last`),
 using the specified allocator.
@@ -1919,152 +1960,166 @@ 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.
-#### `vector` capacity <a id="vector.capacity">[[vector.capacity]]</a>
 ``` cpp
-size_type capacity() const noexcept;
 ```
 *Returns:* The total number of elements that the vector can hold without
 requiring reallocation.
 ``` 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
 if the current capacity is less than the argument of `reserve()`. If an
 exception is thrown other than by the move constructor of a
-non-`CopyInsertable` type, there are no effects.
 *Complexity:* It does not change the size of the sequence and takes at
 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`.
 *Effects:* `shrink_to_fit` is a non-binding request to reduce
 `capacity()` to `size()`.
-[*Note 1*: The request is non-binding to allow latitude for
 implementation-specific optimizations. — *end note*]
 It does not increase `capacity()`, but may reduce `capacity()` by
 causing reallocation. If an exception is thrown other than by the move
-constructor of a non-`CopyInsertable` `T` there are no effects.
-*Complexity:* Linear in the size of the sequence.
 *Remarks:* Reallocation invalidates all the references, pointers, and
 iterators referring to the elements in the sequence as well as the
-past-the-end iterator. If no reallocation happens, they remain valid.
 ``` cpp
-void swap(vector& x)
   noexcept(allocator_traits<Allocator>::propagate_on_container_swap::value ||
            allocator_traits<Allocator>::is_always_equal::value);
 ```
 *Effects:* Exchanges the contents and `capacity()` of `*this` with that
 of `x`.
 *Complexity:* Constant time.
 ``` cpp
-void resize(size_type sz);
 ```
 *Effects:* If `sz < size()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, 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()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, 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;
 ```
 *Returns:* A pointer such that \[`data()`, `data() + size()`) is a valid
 range. For a non-empty vector, `data()` `==` `addressof(front())`.
 *Complexity:* Constant time.
-#### `vector` modifiers <a id="vector.modifiers">[[vector.modifiers]]</a>
 ``` cpp
-iterator insert(const_iterator position, const T& x);
-iterator insert(const_iterator position, T&& x);
-iterator insert(const_iterator position, size_type n, const T& x);
 template<class InputIterator>
-  iterator insert(const_iterator position, InputIterator first, InputIterator last);
-iterator insert(const_iterator position, initializer_list<T>);
-template <class... Args> reference emplace_back(Args&&... args);
-template <class... Args> iterator emplace(const_iterator position, Args&&... args);
-void push_back(const T& x);
-void push_back(T&& x);
 ```
 *Remarks:* Causes reallocation if the new size is greater than the old
 capacity. Reallocation invalidates all the references, pointers, and
-iterators referring to the elements in the sequence. 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_v<T>` 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
-iterator erase(const_iterator position);
-iterator erase(const_iterator first, const_iterator last);
-void pop_back();
 ```
 *Effects:* Invalidates iterators and references at or after the point of
 the erase.
@@ -2074,19 +2129,41 @@ is called the number of times equal to the number of elements in the
 vector after the erased elements.
 *Throws:* Nothing unless an exception is thrown by the assignment
 operator or move assignment operator of `T`.
-#### `vector` specialized algorithms <a id="vector.special">[[vector.special]]</a>
 ``` cpp
-template <class T, class Allocator>
- void swap(vector<T, Allocator>& x, vector<T, Allocator>& y)
- noexcept(noexcept(x.swap(y)));
 ```
-*Effects:* As if by `x.swap(y)`.
 ### Class `vector<bool>` <a id="vector.bool">[[vector.bool]]</a>
 To optimize space allocation, a specialization of vector for `bool`
 elements is provided:
@@ -2094,11 +2171,11 @@ elements is provided:
 ``` cpp
 namespace std {
   template<class Allocator>
   class vector<bool, Allocator> {
   public:
-    // types:
     using value_type             = bool;
     using allocator_type         = Allocator;
     using pointer                = implementation-defined;
     using const_pointer          = implementation-defined;
     using const_reference        = bool;
@@ -2107,107 +2184,106 @@ namespace std {
     using iterator               = implementation-defined  // type of vector<bool>::iterator; // see [container.requirements]
     using const_iterator         = implementation-defined  // type of vector<bool>::const_iterator; // see [container.requirements]
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
-    // bit reference:
     class reference {
       friend class vector;
-      reference() noexcept;
     public:
- ~reference();
- operator bool() const noexcept;
- reference& operator=(const bool x) noexcept;
-      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<bool, Allocator>&& x);
-    vector(const vector&, const Allocator&);
-    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;
-    iterator               end() noexcept;
-    const_iterator         end() const noexcept;
-    reverse_iterator       rbegin() noexcept;
-    const_reverse_iterator rbegin() const noexcept;
-    reverse_iterator       rend() noexcept;
-    const_reverse_iterator rend() const noexcept;
-    const_iterator         cbegin() const noexcept;
-    const_iterator         cend() const noexcept;
-    const_reverse_iterator crbegin() const noexcept;
-    const_reverse_iterator crend() const noexcept;
-    // capacity:
-    bool empty() const noexcept;
-    size_type size() const noexcept;
-    size_type max_size() const noexcept;
-    size_type capacity() const noexcept;
-    void      resize(size_type sz, bool c = false);
-    void      reserve(size_type n);
-    void      shrink_to_fit();
-    // 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;
-    // modifiers:
-    template <class... Args> reference 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);
-    iterator insert(const_iterator position, initializer_list<bool> il);
-    iterator erase(const_iterator position);
-    iterator erase(const_iterator first, const_iterator last);
-    void swap(vector<bool, Allocator>&);
-    static void swap(reference x, reference y) noexcept;
-    void flip() noexcept; // flips all bits
-    void clear() noexcept;
   };
 }
 ```
 Unless described below, all operations have the same requirements and
 semantics as the primary `vector` template, except that operations
 dealing with the `bool` value type map to bit values in the container
-storage and `allocator_traits::construct` (
-[[allocator.traits.members]]) is not used to construct these values.
 There is no requirement that the data be stored as a contiguous
 allocation of `bool` values. A space-optimized representation of bits is
 recommended instead.
@@ -2218,17 +2294,17 @@ is a class that simulates the behavior of references of a single bit in
 set, and `false` otherwise. The assignment operator sets the bit when
 the argument is (convertible to) `true` and clears it otherwise. `flip`
 reverses the state of the bit.
 ``` cpp
-void flip() noexcept;
 ```
 *Effects:* Replaces each element in the container with its complement.
 ``` cpp
-static void swap(reference x, reference y) noexcept;
 ```
 *Effects:* Exchanges the contents of `x` and `y` as if by:
 ``` cpp
@@ -2239,7 +2315,7 @@ y = b;
 ``` cpp
 template<class Allocator> struct hash<vector<bool, Allocator>>;
 ```
-The specialization is enabled ([[unord.hash]]).

 The headers `<array>`, `<deque>`, `<forward_list>`, `<list>`, and
 `<vector>` define class templates that meet the requirements for
 sequence containers.
+The following exposition-only alias template may appear in deduction
+guides for sequence containers:
+``` cpp
+template<class InputIterator>
+  using iter-value-type = typename iterator_traits<InputIterator>::value_type;  // exposition only
+```
 ### Header `<array>` synopsis <a id="array.syn">[[array.syn]]</a>
 ``` cpp
+#include <compare>              // see [compare.syn]
+#include <initializer_list>     // see [initializer.list.syn]
 namespace std {
   // [array], class template array
   template<class T, size_t N> struct array;
   template<class T, size_t N>
+ constexpr bool operator==(const array<T, N>& x, const array<T, N>& y);
   template<class T, size_t N>
+ constexpr synth-three-way-result<T>
+      operator<=>(const array<T, N>& x, const array<T, N>& y);
+  // [array.special], specialized algorithms
   template<class T, size_t N>
+ constexpr void swap(array<T, N>& x, array<T, N>& y) noexcept(noexcept(x.swap(y)));
+  // [array.creation], array creation functions
   template<class T, size_t N>
+ constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]);
   template<class T, size_t N>
+ constexpr array<remove_cv_t<T>, N> to_array(T (&&a)[N]);
+ // [array.tuple], tuple interface
+  template<class T> struct tuple_size;
+  template<size_t I, class T> struct tuple_element;
   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>
 ```
 ### Header `<deque>` synopsis <a id="deque.syn">[[deque.syn]]</a>
 ``` cpp
+#include <compare>              // see [compare.syn]
+#include <initializer_list>     // see [initializer.list.syn]
 namespace std {
   // [deque], class template deque
   template<class T, class Allocator = allocator<T>> class deque;
   template<class T, class Allocator>
     bool operator==(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
   template<class T, class Allocator>
+ synth-three-way-result<T> operator<=>(const deque<T, Allocator>& x,
+    \itcorr                                      const deque<T, Allocator>& y);
   template<class T, class Allocator>
     void swap(deque<T, Allocator>& x, deque<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
+  template<class T, class Allocator, class U>
+    typename deque<T, Allocator>::size_type
+      erase(deque<T, Allocator>& c, const U& value);
+  template<class T, class Allocator, class Predicate>
+    typename deque<T, Allocator>::size_type
+      erase_if(deque<T, Allocator>& c, Predicate pred);
   namespace pmr {
     template<class T>
       using deque = std::deque<T, polymorphic_allocator<T>>;
   }
 }
 ```
+### Header `<forward_list>` synopsis <a id="forward.list.syn">[[forward.list.syn]]</a>
 ``` cpp
+#include <compare>              // see [compare.syn]
+#include <initializer_list>     // see [initializer.list.syn]
 namespace std {
   // [forwardlist], class template forward_list
   template<class T, class Allocator = allocator<T>> class forward_list;
   template<class T, class Allocator>
     bool operator==(const forward_list<T, Allocator>& x, const forward_list<T, Allocator>& y);
   template<class T, class Allocator>
+ synth-three-way-result<T> operator<=>(const forward_list<T, Allocator>& x,
+    \itcorr                                      const forward_list<T, Allocator>& y);
   template<class T, class Allocator>
     void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
+  template<class T, class Allocator, class U>
+    typename forward_list<T, Allocator>::size_type
+      erase(forward_list<T, Allocator>& c, const U& value);
+  template<class T, class Allocator, class Predicate>
+    typename forward_list<T, Allocator>::size_type
+      erase_if(forward_list<T, Allocator>& c, Predicate pred);
   namespace pmr {
     template<class T>
       using forward_list = std::forward_list<T, polymorphic_allocator<T>>;
   }
 }
 ```
 ### Header `<list>` synopsis <a id="list.syn">[[list.syn]]</a>
 ``` cpp
+#include <compare>              // see [compare.syn]
+#include <initializer_list>     // see [initializer.list.syn]
 namespace std {
   // [list], class template list
   template<class T, class Allocator = allocator<T>> class list;
   template<class T, class Allocator>
     bool operator==(const list<T, Allocator>& x, const list<T, Allocator>& y);
   template<class T, class Allocator>
+ synth-three-way-result<T> operator<=>(const list<T, Allocator>& x,
+    \itcorr                                      const list<T, Allocator>& y);
   template<class T, class Allocator>
     void swap(list<T, Allocator>& x, list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
+  template<class T, class Allocator, class U>
+    typename list<T, Allocator>::size_type
+      erase(list<T, Allocator>& c, const U& value);
+  template<class T, class Allocator, class Predicate>
+    typename list<T, Allocator>::size_type
+      erase_if(list<T, Allocator>& c, Predicate pred);
   namespace pmr {
     template<class T>
       using list = std::list<T, polymorphic_allocator<T>>;
   }
 }
 ```
 ### Header `<vector>` synopsis <a id="vector.syn">[[vector.syn]]</a>
 ``` cpp
+#include <compare>              // see [compare.syn]
+#include <initializer_list>     // see [initializer.list.syn]
 namespace std {
   // [vector], class template vector
   template<class T, class Allocator = allocator<T>> class vector;
   template<class T, class Allocator>
+ constexpr bool operator==(const vector<T, Allocator>& x, const vector<T, Allocator>& y);
   template<class T, class Allocator>
+ constexpr synth-three-way-result<T> operator<=>(const vector<T, Allocator>& x,
+              \itcorr                                      const vector<T, Allocator>& y);
   template<class T, class Allocator>
+ constexpr void swap(vector<T, Allocator>& x, vector<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
+  template<class T, class Allocator, class U>
+    constexpr typename vector<T, Allocator>::size_type
+      erase(vector<T, Allocator>& c, const U& value);
+  template<class T, class Allocator, class Predicate>
+    constexpr typename vector<T, Allocator>::size_type
+      erase_if(vector<T, Allocator>& c, Predicate pred);
   // [vector.bool], class vector<bool>
   template<class Allocator> class vector<bool, Allocator>;
   // hash support
   template<class T> struct hash;
 }
 ```
 ### Class template `array` <a id="array">[[array]]</a>
+#### Overview <a id="array.overview">[[array.overview]]</a>
 The header `<array>` defines a class template for storing fixed-size
+sequences of objects. An `array` is a contiguous container
+[[container.requirements.general]]. An instance of `array<T, N>` stores
 `N` elements of type `T`, so that `size() == N` is an invariant.
+An `array` is an aggregate [[dcl.init.aggr]] that can be
 list-initialized with up to `N` elements whose types are convertible to
 `T`.
+An `array` meets all of the requirements of a container and of a
+reversible container [[container.requirements]], except that a default
+constructed `array` object is not empty and that `swap` does not have
+constant complexity. An `array` meets some of the requirements of a
+sequence container [[sequence.reqmts]]. Descriptions are provided here
+only for operations on `array` that are not described in one of these
+tables and for operations where there is additional semantic
+information.
+`array<T, N>` is a structural type [[temp.param]] if `T` is a structural
+type. Two values `a1` and `a2` of type `array<T, N>` are
+template-argument-equivalent [[temp.type]] if and only if each pair of
+corresponding elements in `a1` and `a2` are
+template-argument-equivalent.
+The types `iterator` and `const_iterator` meet the constexpr iterator
+requirements [[iterator.requirements.general]].
 ``` cpp
 namespace std {
   template<class T, size_t N>
   struct array {
+    // types
     using value_type             = T;
     using pointer                = T*;
     using const_pointer          = const T*;
     using reference              = T&;
     using const_reference        = const T&;
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
     // no explicit construct/copy/destroy for aggregate type
+ constexpr void fill(const T& u);
+ constexpr void swap(array&) noexcept(is_nothrow_swappable_v<T>);
+    // iterators
     constexpr iterator               begin() noexcept;
     constexpr const_iterator         begin() const noexcept;
     constexpr iterator               end() noexcept;
     constexpr const_iterator         end() const noexcept;
     constexpr const_iterator         cbegin() const noexcept;
     constexpr const_iterator         cend() const noexcept;
     constexpr const_reverse_iterator crbegin() const noexcept;
     constexpr const_reverse_iterator crend() const noexcept;
+    // capacity
+ [[nodiscard]] constexpr bool empty() const noexcept;
     constexpr size_type size() const noexcept;
     constexpr size_type max_size() const noexcept;
+    // element access
     constexpr reference       operator[](size_type n);
     constexpr const_reference operator[](size_type n) const;
     constexpr reference       at(size_type n);
     constexpr const_reference at(size_type n) const;
     constexpr reference       front();
   template<class T, class... U>
     array(T, U...) -> array<T, 1 + sizeof...(U)>;
 }
 ```
+#### Constructors, copy, and assignment <a id="array.cons">[[array.cons]]</a>
+The conditions for an aggregate [[dcl.init.aggr]] shall be met. Class
 `array` relies on the implicitly-declared special member functions (
+[[class.default.ctor]], [[class.dtor]], and [[class.copy.ctor]]) to
+conform to the container requirements table in
+[[container.requirements]]. In addition to the requirements specified in
+the container requirements table, the implicit move constructor and move
+assignment operator for `array` require that `T` be
+*Cpp17MoveConstructible* or *Cpp17MoveAssignable*, respectively.
 ``` cpp
 template<class T, class... U>
   array(T, U...) -> array<T, 1 + sizeof...(U)>;
 ```
+*Mandates:* `(is_same_v<T, U> && ...)` is `true`.
+#### Member functions <a id="array.members">[[array.members]]</a>
 ``` cpp
+constexpr size_type size() const noexcept;
 ```
 *Returns:* `N`.
 ``` cpp
 constexpr T* data() noexcept;
 constexpr const T* data() const noexcept;
 ```
+*Returns:* A pointer such that \[`data()`, `data() + size()`) is a valid
+range. For a non-empty array, `data()` `==` `addressof(front())`.
 ``` cpp
+constexpr void fill(const T& u);
 ```
 *Effects:* As if by `fill_n(begin(), N, u)`.
 ``` cpp
+constexpr void swap(array& y) noexcept(is_nothrow_swappable_v<T>);
 ```
 *Effects:* Equivalent to `swap_ranges(begin(), end(), y.begin())`.
 [*Note 1*: 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. — *end note*]
+#### Specialized algorithms <a id="array.special">[[array.special]]</a>
+``` cpp
+template<class T, size_t N>
+  constexpr void swap(array<T, N>& x, array<T, N>& y) noexcept(noexcept(x.swap(y)));
+```
+*Constraints:* `N == 0` or `is_swappable_v<T>` is `true`.
+*Effects:* As if by `x.swap(y)`.
+*Complexity:* Linear in `N`.
+#### Zero-sized arrays <a id="array.zero">[[array.zero]]</a>
 `array` shall provide support for the special case `N == 0`.
 In the case that `N == 0`, `begin() == end() ==` unique value. The
 return value of `data()` is unspecified.
 undefined.
 Member function `swap()` shall have a non-throwing exception
 specification.
+#### Array creation functions <a id="array.creation">[[array.creation]]</a>
+``` cpp
+template<class T, size_t N>
+  constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]);
+```
+*Mandates:* `is_array_v<T>` is `false` and `is_constructible_v<T, T&>`
+is `true`.
+*Preconditions:* `T` meets the *Cpp17CopyConstructible* requirements.
+*Returns:* `{{ a[0], `…`, a[N - 1] }}`.
+``` cpp
+template<class T, size_t N>
+  constexpr array<remove_cv_t<T>, N> to_array(T (&&a)[N]);
+```
+*Mandates:* `is_array_v<T>` is `false` and `is_move_constructible_v<T>`
+is `true`.
+*Preconditions:* `T` meets the *Cpp17MoveConstructible* requirements.
+*Returns:* `{{ std::move(a[0]), `…`, std::move(a[N - 1]) }}`.
+#### Tuple interface <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
+template<size_t I, class T, size_t N>
+  struct tuple_element<I, array<T, N>> {
+    using type = T;
+  };
 ```
+*Mandates:* `I < N` is `true`.
 ``` cpp
 template<size_t I, class T, size_t N>
   constexpr T& get(array<T, N>& a) noexcept;
 template<size_t I, class T, size_t N>
   constexpr const T& get(const array<T, N>& a) noexcept;
 template<size_t I, class T, size_t N>
   constexpr const T&& get(const array<T, N>&& a) noexcept;
 ```
+*Mandates:* `I < N` is `true`.
+*Returns:* A reference to the `I`ᵗʰ element of `a`, where indexing is
 zero-based.
 ### Class template `deque` <a id="deque">[[deque]]</a>
+#### Overview <a id="deque.overview">[[deque.overview]]</a>
 A `deque` is a sequence container that supports random access iterators
+[[random.access.iterators]]. In addition, it supports constant time
 insert and erase operations at the beginning or the end; insert and
 erase in the middle take linear time. That is, a deque is especially
 optimized for pushing and popping elements at the beginning and end.
 Storage management is handled automatically.
+A `deque` meets all of the requirements of a container, of a reversible
+container (given in tables in  [[container.requirements]]), of a
+sequence container, including the optional sequence container
+requirements [[sequence.reqmts]], and of an allocator-aware container (
+[[container.alloc.req]]). Descriptions are provided here only for
+operations on `deque` that are not described in one of these tables or
+for operations where there is additional semantic information.
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class deque {
   public:
+    // types
     using value_type             = T;
     using allocator_type         = Allocator;
     using pointer                = typename allocator_traits<Allocator>::pointer;
     using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
       void assign(InputIterator first, InputIterator last);
     void assign(size_type n, const T& t);
     void assign(initializer_list<T>);
     allocator_type get_allocator() const noexcept;
+    // iterators
     iterator               begin() noexcept;
     const_iterator         begin() const noexcept;
     iterator               end() noexcept;
     const_iterator         end() const noexcept;
     reverse_iterator       rbegin() noexcept;
     const_iterator         cend() const noexcept;
     const_reverse_iterator crbegin() const noexcept;
     const_reverse_iterator crend() const noexcept;
     // [deque.capacity], capacity
+ [[nodiscard]] bool empty() const noexcept;
     size_type size() const noexcept;
     size_type max_size() const noexcept;
     void      resize(size_type sz);
     void      resize(size_type sz, const T& c);
     void      shrink_to_fit();
+    // element access
     reference       operator[](size_type n);
     const_reference operator[](size_type n) const;
     reference       at(size_type n);
     const_reference at(size_type n) const;
     reference       front();
     void     swap(deque&)
       noexcept(allocator_traits<Allocator>::is_always_equal::value);
     void     clear() noexcept;
   };
+  template<class InputIterator, class Allocator = allocator<iter-value-type<InputIterator>>>
     deque(InputIterator, InputIterator, Allocator = Allocator())
+      -> deque<iter-value-type<InputIterator>, Allocator>;
+ // swap
   template<class T, class Allocator>
     void swap(deque<T, Allocator>& x, deque<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
+#### Constructors, copy, and assignment <a id="deque.cons">[[deque.cons]]</a>
 ``` cpp
 explicit deque(const Allocator&);
 ```
 ```
 *Effects:* Constructs a `deque` with `n` default-inserted elements using
 the specified allocator.
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 deque(size_type n, const T& value, const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `deque` with `n` copies of `value`, using the
 specified allocator.
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
 *Effects:* Constructs a `deque` equal to the range \[`first`, `last`),
 using the specified allocator.
 *Complexity:* Linear in `distance(first, last)`.
+#### Capacity <a id="deque.capacity">[[deque.capacity]]</a>
 ``` cpp
 void resize(size_type sz);
 ```
+*Preconditions:* `T` is *Cpp17MoveInsertable* and
+*Cpp17DefaultInsertable* into `*this`.
 *Effects:* If `sz < size()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, appends `sz - size()` default-inserted elements
 to the sequence.
 ``` cpp
 void resize(size_type sz, const T& c);
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* If `sz < size()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, appends `sz - size()` copies of `c` to the
 sequence.
 ``` cpp
 void shrink_to_fit();
 ```
+*Preconditions:* `T` is *Cpp17MoveInsertable* into `*this`.
 *Effects:* `shrink_to_fit` is a non-binding request to reduce memory use
 but does not change the size of the sequence.
 [*Note 1*: The request is non-binding to allow latitude for
 implementation-specific optimizations. — *end note*]
+If the size is equal to the old capacity, or if an exception is thrown
+other than by the move constructor of a non-*Cpp17CopyInsertable* `T`,
+then there are no effects.
+*Complexity:* If the size is not equal to the old capacity, linear in
+the size of the sequence; otherwise constant.
+*Remarks:* If the size is not equal to the old capacity, then
+invalidates all the references, pointers, and iterators referring to the
+elements in the sequence, as well as the past-the-end iterator.
+#### Modifiers <a id="deque.modifiers">[[deque.modifiers]]</a>
 ``` cpp
 iterator insert(const_iterator position, const T& x);
 iterator insert(const_iterator position, T&& x);
 iterator insert(const_iterator position, size_type n, const T& x);
 *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-*Cpp17CopyInsertable* `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 at either the beginning or end of
 a deque always takes constant time and causes a single call to a
 constructor of `T`.
 ``` cpp
 iterator erase(const_iterator position);
 as the number of elements erased, but the number of calls to the
 assignment operator of `T` is no more than the lesser of the number of
 elements before the erased elements and the number of elements after the
 erased elements.
+*Throws:* Nothing unless an exception is thrown by the assignment
+operator of `T`.
+#### Erasure <a id="deque.erasure">[[deque.erasure]]</a>
 ``` cpp
+template<class T, class Allocator, class U>
+ typename deque<T, Allocator>::size_type
+ erase(deque<T, Allocator>& c, const U& value);
 ```
+*Effects:* Equivalent to:
+``` cpp
+auto it = remove(c.begin(), c.end(), value);
+auto r = distance(it, c.end());
+c.erase(it, c.end());
+return r;
+```
+``` cpp
+template<class T, class Allocator, class Predicate>
+  typename deque<T, Allocator>::size_type
+    erase_if(deque<T, Allocator>& c, Predicate pred);
+```
+*Effects:* Equivalent to:
+``` cpp
+auto it = remove_if(c.begin(), c.end(), pred);
+auto r = distance(it, c.end());
+c.erase(it, c.end());
+return r;
+```
 ### Class template `forward_list` <a id="forwardlist">[[forwardlist]]</a>
+#### Overview <a id="forwardlist.overview">[[forwardlist.overview]]</a>
 A `forward_list` is a container that supports forward iterators and
 allows constant time insert and erase operations anywhere within the
 sequence, with storage management handled automatically. Fast random
 access to list elements is not supported.
 [*Note 1*: It is intended that `forward_list` have zero space or time
 overhead relative to a hand-written C-style singly linked list. Features
 that would conflict with that goal have been omitted. — *end note*]
+A `forward_list` meets all of the requirements of a container (
+[[container.req]]), except that the `size()` member function is not
+provided and `operator==` has linear complexity. A `forward_list` also
+meets all of the requirements for an allocator-aware container (
+[[container.alloc.req]]). In addition, a `forward_list` provides the
+`assign` member functions ([[container.seq.req]]) and several of the
+optional container requirements ([[container.seq.opt]]). 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.
 [*Note 2*: 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
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class forward_list {
   public:
+    // types
     using value_type      = T;
     using allocator_type  = Allocator;
     using pointer         = typename allocator_traits<Allocator>::pointer;
     using const_pointer   = typename allocator_traits<Allocator>::const_pointer;
     using reference       = value_type&;
     // [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(const forward_list& x);
     forward_list(forward_list&& x);
     forward_list(const forward_list& x, const Allocator&);
     forward_list(forward_list&& x, const Allocator&);
     forward_list(initializer_list<T>, const Allocator& = Allocator());
     const_iterator cbegin() const noexcept;
     const_iterator cbefore_begin() const noexcept;
     const_iterator cend() const noexcept;
+    // capacity
+ [[nodiscard]] bool empty() const noexcept;
     size_type max_size() const noexcept;
     // [forwardlist.access], element access
     reference front();
     const_reference front() const;
     void clear() noexcept;
     // [forwardlist.ops], forward_list operations
     void splice_after(const_iterator position, forward_list& x);
     void splice_after(const_iterator position, forward_list&& x);
+    void splice_after(const_iterator position, forward_list& x, const_iterator i);
+    void splice_after(const_iterator position, forward_list&& x, const_iterator i);
     void splice_after(const_iterator position, forward_list& x,
                       const_iterator first, const_iterator last);
     void splice_after(const_iterator position, forward_list&& x,
                       const_iterator first, const_iterator last);
+ size_type remove(const T& value);
+    template<class Predicate> size_type remove_if(Predicate pred);
+ size_type unique();
+    template<class BinaryPredicate> size_type unique(BinaryPredicate binary_pred);
     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);
     template<class Compare> void sort(Compare comp);
     void reverse() noexcept;
   };
+  template<class InputIterator, class Allocator = allocator<iter-value-type<InputIterator>>>
     forward_list(InputIterator, InputIterator, Allocator = Allocator())
+      -> forward_list<iter-value-type<InputIterator>, Allocator>;
+ // swap
   template<class T, class Allocator>
     void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
 An incomplete type `T` may be used when instantiating `forward_list` if
+the allocator meets the allocator completeness requirements
+[[allocator.requirements.completeness]]. `T` shall be complete before
 any member of the resulting specialization of `forward_list` is
 referenced.
+#### Constructors, copy, and assignment <a id="forwardlist.cons">[[forwardlist.cons]]</a>
 ``` cpp
 explicit forward_list(const Allocator&);
 ```
 ``` cpp
 explicit forward_list(size_type n, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Effects:* Constructs a `forward_list` object with `n` default-inserted
 elements using the specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 forward_list(size_type n, const T& value, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* Constructs a `forward_list` object with `n` copies of `value`
 using the specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
   forward_list(InputIterator first, InputIterator last, const Allocator& = Allocator());
 *Effects:* Constructs a `forward_list` object equal to the range
 \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
+#### Iterators <a id="forwardlist.iter">[[forwardlist.iter]]</a>
 ``` cpp
 iterator before_begin() noexcept;
 const_iterator before_begin() const noexcept;
 const_iterator cbefore_begin() const noexcept;
 *Effects:* `cbefore_begin()` is equivalent to
 `const_cast<forward_list const&>(*this).before_begin()`.
 *Remarks:* `before_begin() == end()` shall equal `false`.
+#### Element access <a id="forwardlist.access">[[forwardlist.access]]</a>
 ``` cpp
 reference front();
 const_reference front() const;
 ```
 *Returns:* `*begin()`
+#### Modifiers <a id="forwardlist.modifiers">[[forwardlist.modifiers]]</a>
 None of the overloads of `insert_after` shall affect the validity of
 iterators and references, and `erase_after` shall invalidate only
 iterators and references to the erased elements. If an exception is
 thrown during `insert_after` there shall be no effect. Inserting `n`
 ``` cpp
 iterator insert_after(const_iterator position, const T& x);
 iterator insert_after(const_iterator position, T&& x);
 ```
+*Preconditions:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
 *Effects:* Inserts a copy of `x` after `position`.
 *Returns:* An iterator pointing to the copy of `x`.
 ``` cpp
 iterator insert_after(const_iterator position, size_type n, const T& x);
 ```
+*Preconditions:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
 *Effects:* Inserts `n` copies of `x` after `position`.
 *Returns:* An iterator pointing to the last inserted copy of `x` or
 ``` cpp
 template<class InputIterator>
   iterator insert_after(const_iterator position, InputIterator first, InputIterator last);
 ```
+*Preconditions:* `position` is `before_begin()` or is a dereferenceable
+iterator in the range \[`begin()`, `end()`). Neither `first` nor `last`
+are iterators in `*this`.
 *Effects:* Inserts copies of elements in \[`first`, `last`) after
 `position`.
 *Returns:* An iterator pointing to the last inserted element or
 ``` cpp
 template<class... Args>
   iterator emplace_after(const_iterator position, Args&&... args);
 ```
+*Preconditions:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
 *Effects:* Inserts an object of type `value_type` constructed with
 `value_type(std::forward<Args>(args)...)` after `position`.
 ``` cpp
 iterator erase_after(const_iterator position);
 ```
+*Preconditions:* The iterator following `position` is dereferenceable.
 *Effects:* Erases the element pointed to by the iterator following
 `position`.
 *Returns:* An iterator pointing to the element following the one that
 ``` cpp
 iterator erase_after(const_iterator position, const_iterator last);
 ```
+*Preconditions:* All iterators in the range (`position`, `last`) are
 dereferenceable.
 *Effects:* Erases the elements in the range (`position`, `last`).
 *Returns:* `last`.
 ``` cpp
 void resize(size_type sz);
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *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.
 ``` cpp
 void resize(size_type sz, const value_type& c);
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* If `sz < distance(begin(), end())`, erases the last
 `distance(begin(), end()) - sz` elements from the list. Otherwise,
 inserts `sz - distance(begin(), end())` copies of `c` at the end of the
 list.
 ``` cpp
 void clear() noexcept;
 ```
 *Effects:* Erases all elements in the range \[`begin()`, `end()`).
 *Remarks:* Does not invalidate past-the-end iterators.
+#### Operations <a id="forwardlist.ops">[[forwardlist.ops]]</a>
+In this subclause, arguments for a template parameter named `Predicate`
+or `BinaryPredicate` shall meet the corresponding requirements in
+[[algorithms.requirements]]. For `merge` and `sort`, the definitions and
+requirements in [[alg.sorting]] apply.
 ``` cpp
 void splice_after(const_iterator position, forward_list& x);
 void splice_after(const_iterator position, forward_list&& x);
 ```
+*Preconditions:* `position` is `before_begin()` or is a dereferenceable
 iterator in the range \[`begin()`, `end()`).
+`get_allocator() == x.get_allocator()` is `true`. `addressof(x) != this`
+is `true`.
 *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
 ``` cpp
 void splice_after(const_iterator position, forward_list& x, const_iterator i);
 void splice_after(const_iterator position, forward_list&& x, const_iterator i);
 ```
+*Preconditions:* `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()` is `true`.
 *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`.
                   const_iterator first, const_iterator last);
 void splice_after(const_iterator position, forward_list&& x,
                   const_iterator first, const_iterator last);
 ```
+*Preconditions:* `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()` is `true`.
 *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
 into `*this`, not into `x`.
 *Complexity:* 𝑂(`distance(first, last)`)
 ``` cpp
+size_type remove(const T& value);
+template<class Predicate> size_type remove_if(Predicate pred);
 ```
+*Effects:* Erases all the elements in the list referred to 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.
+*Returns:* The number of elements erased.
 *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
+size_type unique();
+template<class BinaryPredicate> size_type unique(BinaryPredicate pred);
 ```
 *Effects:* Erases all but the first element from every consecutive group
 of equal elements referred to by the iterator `i` in the range
 \[`first + 1`, `last`) for which `*i == *(i-1)` (for the version with no
 arguments) or `pred(*i, *(i - 1))` (for the version with a predicate
 argument) holds. Invalidates only the iterators and references to the
 erased elements.
+*Returns:* The number of elements erased.
 *Throws:* Nothing unless an exception is thrown by the equality
 comparison or the predicate.
 *Complexity:* If the range \[`first`, `last`) is not empty, exactly
 `(last - first) - 1` applications of the corresponding predicate,
 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);
 ```
+*Preconditions:* `*this` and `x` are both sorted with respect to the
+comparator `operator<` (for the first two overloads) or `comp` (for the
+last two overloads), and `get_allocator() == x.get_allocator()` is
+`true`.
 *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]].
 *Complexity:* At most
 `distance(begin(), end()) + distance(x.begin(), x.end()) - 1`
 comparisons.
 ``` cpp
 void sort();
 template<class Compare> void sort(Compare comp);
 ```
 *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
 *Effects:* Reverses the order of the elements in the list. Does not
 affect the validity of iterators and references.
 *Complexity:* Linear time.
+#### Erasure <a id="forward.list.erasure">[[forward.list.erasure]]</a>
 ``` cpp
+template<class T, class Allocator, class U>
+ typename forward_list<T, Allocator>::size_type
+ erase(forward_list<T, Allocator>& c, const U& value);
 ```
+*Effects:* Equivalent to:
+`return erase_if(c, [&](auto& elem) { return elem == value; });`
+``` cpp
+template<class T, class Allocator, class Predicate>
+  typename forward_list<T, Allocator>::size_type
+    erase_if(forward_list<T, Allocator>& c, Predicate pred);
+```
+*Effects:* Equivalent to: `return c.remove_if(pred);`
 ### Class template `list` <a id="list">[[list]]</a>
+#### Overview <a id="list.overview">[[list.overview]]</a>
 A `list` is a sequence container that supports bidirectional iterators
 and allows constant time insert and erase operations anywhere within the
+sequence, with storage management handled automatically. Unlike vectors
+[[vector]] and deques [[deque]], fast random access to list elements is
+not supported, but many algorithms only need sequential access anyway.
+A `list` meets all of the requirements of a container, of a reversible
+container (given in two tables in [[container.requirements]]), of a
+sequence container, including most of the optional sequence container
+requirements [[sequence.reqmts]], and of an allocator-aware container (
+[[container.alloc.req]]). The exceptions are the `operator[]` and `at`
+member functions, which are not provided.[^2] Descriptions are provided
+here only for operations on `list` that are not described in one of
+these tables or for operations where there is additional semantic
 information.
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class list {
   public:
+    // types
     using value_type             = T;
     using allocator_type         = Allocator;
     using pointer                = typename allocator_traits<Allocator>::pointer;
     using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
       void assign(InputIterator first, InputIterator last);
     void assign(size_type n, const T& t);
     void assign(initializer_list<T>);
     allocator_type get_allocator() const noexcept;
+    // iterators
     iterator               begin() noexcept;
     const_iterator         begin() const noexcept;
     iterator               end() noexcept;
     const_iterator         end() const noexcept;
     reverse_iterator       rbegin() noexcept;
     const_iterator         cend() const noexcept;
     const_reverse_iterator crbegin() const noexcept;
     const_reverse_iterator crend() const noexcept;
     // [list.capacity], capacity
+ [[nodiscard]] bool empty() const noexcept;
     size_type size() const noexcept;
     size_type max_size() const noexcept;
     void      resize(size_type sz);
     void      resize(size_type sz, const T& c);
+    // element access
     reference       front();
     const_reference front() const;
     reference       back();
     const_reference back() const;
     template<class... Args> iterator emplace(const_iterator position, Args&&... args);
     iterator insert(const_iterator position, const T& x);
     iterator insert(const_iterator position, T&& x);
     iterator insert(const_iterator position, size_type n, const T& x);
     template<class InputIterator>
+      iterator insert(const_iterator position, InputIterator first, InputIterator last);
     iterator insert(const_iterator position, initializer_list<T> il);
     iterator erase(const_iterator position);
     iterator erase(const_iterator position, const_iterator last);
+    void     swap(list&) noexcept(allocator_traits<Allocator>::is_always_equal::value);
     void     clear() noexcept;
     // [list.ops], list operations
     void splice(const_iterator position, list& x);
     void splice(const_iterator position, list&& x);
     void splice(const_iterator position, list& x, const_iterator i);
     void splice(const_iterator position, list&& x, const_iterator i);
+    void splice(const_iterator position, list& x, const_iterator first, const_iterator last);
+    void splice(const_iterator position, list&& x, const_iterator first, const_iterator last);
+ size_type remove(const T& value);
+    template<class Predicate> size_type remove_if(Predicate pred);
+ size_type unique();
     template<class BinaryPredicate>
+ size_type unique(BinaryPredicate binary_pred);
     void merge(list& x);
     void merge(list&& x);
     template<class Compare> void merge(list& x, Compare comp);
     template<class Compare> void merge(list&& x, Compare comp);
     template<class Compare> void sort(Compare comp);
     void reverse() noexcept;
   };
+  template<class InputIterator, class Allocator = allocator<iter-value-type<InputIterator>>>
     list(InputIterator, InputIterator, Allocator = Allocator())
+      -> list<iter-value-type<InputIterator>, Allocator>;
+ // swap
   template<class T, class Allocator>
     void swap(list<T, Allocator>& x, list<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
 An incomplete type `T` may be used when instantiating `list` if the
+allocator meets the allocator completeness requirements
+[[allocator.requirements.completeness]]. `T` shall be complete before
 any member of the resulting specialization of `list` is referenced.
+#### Constructors, copy, and assignment <a id="list.cons">[[list.cons]]</a>
 ``` cpp
 explicit list(const Allocator&);
 ```
 ``` cpp
 explicit list(size_type n, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Effects:* Constructs a `list` with `n` default-inserted elements using
 the specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 list(size_type n, const T& value, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* Constructs a `list` with `n` copies of `value`, using the
 specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
   list(InputIterator first, InputIterator last, const Allocator& = Allocator());
 *Effects:* Constructs a `list` equal to the range \[`first`, `last`).
 *Complexity:* Linear in `distance(first, last)`.
+#### Capacity <a id="list.capacity">[[list.capacity]]</a>
 ``` cpp
 void resize(size_type sz);
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *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());
 ```
 ``` cpp
 void resize(size_type sz, const T& c);
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* As if by:
 ``` cpp
 if (sz > size())
   insert(end(), sz-size(), c);
 }
 else
   ;                 // do nothing
 ```
+#### Modifiers <a id="list.modifiers">[[list.modifiers]]</a>
 ``` cpp
 iterator insert(const_iterator position, const T& x);
 iterator insert(const_iterator position, T&& x);
 iterator insert(const_iterator position, size_type n, const T& x);
 *Complexity:* Erasing a single element is a constant time operation with
 a single call to the destructor of `T`. Erasing a range in a list is
 linear time in the size of the range and the number of calls to the
 destructor of type `T` is exactly equal to the size of the range.
+#### Operations <a id="list.ops">[[list.ops]]</a>
 Since lists allow fast insertion and erasing from the middle of a list,
+certain operations are provided specifically for them.[^3] In this
+subclause, arguments for a template parameter named `Predicate` or
+`BinaryPredicate` shall meet the corresponding requirements in
+[[algorithms.requirements]]. For `merge` and `sort`, the definitions and
+requirements in [[alg.sorting]] apply.
 `list` provides three splice operations that destructively move elements
 from one list to another. The behavior of splice operations is undefined
 if `get_allocator() !=
 x.get_allocator()`.
 ``` cpp
 void splice(const_iterator position, list& x);
 void splice(const_iterator position, list&& x);
 ```
+*Preconditions:* `addressof(x) != this` is `true`.
 *Effects:* Inserts the contents of `x` before `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
 ``` cpp
 void splice(const_iterator position, list& x, const_iterator i);
 void splice(const_iterator position, list&& x, const_iterator i);
 ```
+*Preconditions:* `i` is a valid dereferenceable iterator of `x`.
 *Effects:* Inserts an element pointed to by `i` from list `x` before
 `position` and removes the element from `x`. The result is unchanged if
 `position == i` or `position == ++i`. Pointers and references to `*i`
 continue to refer to this same element but as a member of `*this`.
             const_iterator last);
 void splice(const_iterator position, list&& x, const_iterator first,
             const_iterator last);
 ```
+*Preconditions:* `[first, last)` is a valid range in `x`. `position` is
+not an iterator in the range \[`first`, `last`).
 *Effects:* Inserts elements in the range \[`first`, `last`) before
 `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
 continue to refer to their elements, but they now behave as iterators
 into `*this`, not into `x`.
 *Throws:* Nothing.
+*Complexity:* Constant time if `addressof(x) == this`; otherwise, linear
+time.
 ``` cpp
+size_type remove(const T& value);
+template<class Predicate> size_type remove_if(Predicate pred);
 ```
+*Effects:* Erases all the elements in the list referred to by a list
+iterator `i` for which the following conditions hold: `*i == value`,
+`pred(*i) != false`. Invalidates only the iterators and references to
+the erased elements.
+*Returns:* The number of elements erased.
 *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
+size_type unique();
+template<class BinaryPredicate> size_type unique(BinaryPredicate binary_pred);
 ```
 *Effects:* Erases all but the first element from every consecutive group
 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.
+*Returns:* The number of elements erased.
 *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,
 void merge(list&& x);
 template<class Compare> void merge(list& x, Compare comp);
 template<class Compare> void merge(list&& x, Compare comp);
 ```
+*Preconditions:* Both the list and the argument list shall be sorted
+with respect to the comparator `operator<` (for the first two overloads)
+or `comp` (for the last two overloads), and
+`get_allocator() == x.get_allocator()` is `true`.
+*Effects:* If `addressof(x) == this`, does nothing; otherwise, merges
+the two sorted ranges `[begin(), end())` and `[x.begin(), x.end())`. The
+result is a range in which the elements will be sorted in non-decreasing
+order according to the ordering defined by `comp`; that is, for every
+iterator `i`, in the range other than the first, the condition
 `comp(*i, *(i - 1))` will be `false`. 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]]. If `addressof(x) != this`, the
+range `[x.begin(), x.end())` is empty after the merge. No elements are
+copied by this operation.
 *Complexity:* At most `size() + x.size() - 1` applications of `comp` if
+`addressof(x) != this`; otherwise, no applications of `comp` are
+performed. If an exception is thrown other than by a comparison there
+are no effects.
 ``` cpp
 void reverse() noexcept;
 ```
 ``` cpp
 void sort();
 template<class Compare> void sort(Compare comp);
 ```
 *Effects:* Sorts the list according to the `operator<` or a `Compare`
 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 == size()`.
+#### Erasure <a id="list.erasure">[[list.erasure]]</a>
 ``` cpp
+template<class T, class Allocator, class U>
+ typename list<T, Allocator>::size_type
+ erase(list<T, Allocator>& c, const U& value);
 ```
+*Effects:* Equivalent to:
+`return erase_if(c, [&](auto& elem) { return elem == value; });`
+``` cpp
+template<class T, class Allocator, class Predicate>
+  typename list<T, Allocator>::size_type
+    erase_if(list<T, Allocator>& c, Predicate pred);
+```
+*Effects:* Equivalent to: `return c.remove_if(pred);`
 ### Class template `vector` <a id="vector">[[vector]]</a>
+#### Overview <a id="vector.overview">[[vector.overview]]</a>
 A `vector` is a sequence container that supports (amortized) constant
 time insert and erase operations at the end; insert and erase in the
 middle take linear time. Storage management is handled automatically,
 though hints can be given to improve efficiency.
+A `vector` meets all of the requirements of a container and of a
 reversible container (given in two tables in
 [[container.requirements]]), of a sequence container, including most of
+the optional sequence container requirements [[sequence.reqmts]], of an
+allocator-aware container ([[container.alloc.req]]), and, for an
+element type other than `bool`, of a contiguous container
+[[container.requirements.general]]. The exceptions are the `push_front`,
+`pop_front`, and `emplace_front` member functions, which are not
+provided. Descriptions are provided here only for operations on `vector`
+that are not described in one of these tables or for operations where
+there is additional semantic information.
+The types `iterator` and `const_iterator` meet the constexpr iterator
+requirements [[iterator.requirements.general]].
 ``` cpp
 namespace std {
   template<class T, class Allocator = allocator<T>>
   class vector {
   public:
+    // types
     using value_type             = T;
     using allocator_type         = Allocator;
     using pointer                = typename allocator_traits<Allocator>::pointer;
     using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
     using reference              = value_type&;
     using const_iterator         = implementation-defined  // type of vector::const_iterator; // see [container.requirements]
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
     // [vector.cons], construct/copy/destroy
+ constexpr vector() noexcept(noexcept(Allocator())) : vector(Allocator()) { }
+ constexpr explicit vector(const Allocator&) noexcept;
+ constexpr explicit vector(size_type n, const Allocator& = Allocator());
+ constexpr vector(size_type n, const T& value, const Allocator& = Allocator());
     template<class InputIterator>
+ constexpr vector(InputIterator first, InputIterator last, const Allocator& = Allocator());
+ constexpr vector(const vector& x);
+ constexpr vector(vector&&) noexcept;
+ constexpr vector(const vector&, const Allocator&);
+ constexpr vector(vector&&, const Allocator&);
+ constexpr vector(initializer_list<T>, const Allocator& = Allocator());
+ constexpr ~vector();
+ constexpr vector& operator=(const vector& x);
+ constexpr vector& operator=(vector&& x)
       noexcept(allocator_traits<Allocator>::propagate_on_container_move_assignment::value ||
                allocator_traits<Allocator>::is_always_equal::value);
+ constexpr vector& operator=(initializer_list<T>);
     template<class InputIterator>
+ constexpr void assign(InputIterator first, InputIterator last);
+ constexpr void assign(size_type n, const T& u);
+ constexpr void assign(initializer_list<T>);
+ constexpr allocator_type get_allocator() const noexcept;
+    // iterators
+ constexpr iterator               begin() noexcept;
+ constexpr const_iterator         begin() const noexcept;
+ constexpr iterator               end() noexcept;
+ constexpr const_iterator         end() const noexcept;
+ constexpr reverse_iterator       rbegin() noexcept;
+ constexpr const_reverse_iterator rbegin() const noexcept;
+ constexpr reverse_iterator       rend() noexcept;
+ constexpr const_reverse_iterator rend() const noexcept;
+ constexpr const_iterator         cbegin() const noexcept;
+ constexpr const_iterator         cend() const noexcept;
+ constexpr const_reverse_iterator crbegin() const noexcept;
+ constexpr const_reverse_iterator crend() const noexcept;
     // [vector.capacity], capacity
+ [[nodiscard]] constexpr bool empty() const noexcept;
+ constexpr size_type size() const noexcept;
+ constexpr size_type max_size() const noexcept;
+ constexpr size_type capacity() const noexcept;
+ constexpr void      resize(size_type sz);
+ constexpr void      resize(size_type sz, const T& c);
+ constexpr void      reserve(size_type n);
+ constexpr void      shrink_to_fit();
+    // element access
+ constexpr reference       operator[](size_type n);
+ constexpr const_reference operator[](size_type n) const;
+ constexpr const_reference at(size_type n) const;
+ constexpr reference       at(size_type n);
+ constexpr reference       front();
+ constexpr const_reference front() const;
+ constexpr reference       back();
+ constexpr const_reference back() const;
     // [vector.data], data access
+ constexpr T*       data() noexcept;
+ constexpr const T* data() const noexcept;
     // [vector.modifiers], modifiers
+    template<class... Args> constexpr reference emplace_back(Args&&... args);
+ constexpr void push_back(const T& x);
+ constexpr void push_back(T&& x);
+ constexpr void pop_back();
+    template<class... Args> constexpr iterator emplace(const_iterator position, Args&&... args);
+ constexpr iterator insert(const_iterator position, const T& x);
+ constexpr iterator insert(const_iterator position, T&& x);
+ constexpr iterator insert(const_iterator position, size_type n, const T& x);
     template<class InputIterator>
+ constexpr iterator insert(const_iterator position,
+                                InputIterator first, InputIterator last);
+ constexpr iterator insert(const_iterator position, initializer_list<T> il);
+ constexpr iterator erase(const_iterator position);
+ constexpr iterator erase(const_iterator first, const_iterator last);
+    constexpr void     swap(vector&)
       noexcept(allocator_traits<Allocator>::propagate_on_container_swap::value ||
                allocator_traits<Allocator>::is_always_equal::value);
+ constexpr void     clear() noexcept;
   };
+  template<class InputIterator, class Allocator = allocator<iter-value-type<InputIterator>>>
     vector(InputIterator, InputIterator, Allocator = Allocator())
+      -> vector<iter-value-type<InputIterator>, Allocator>;
+  // swap
   template<class T, class Allocator>
+ constexpr void swap(vector<T, Allocator>& x, vector<T, Allocator>& y)
       noexcept(noexcept(x.swap(y)));
 }
 ```
 An incomplete type `T` may be used when instantiating `vector` if the
+allocator meets the allocator completeness requirements
+[[allocator.requirements.completeness]]. `T` shall be complete before
 any member of the resulting specialization of `vector` is referenced.
+#### Constructors, copy, and assignment <a id="vector.cons">[[vector.cons]]</a>
 ``` cpp
+constexpr explicit vector(const Allocator&) noexcept;
 ```
 *Effects:* Constructs an empty `vector`, using the specified allocator.
 *Complexity:* Constant.
 ``` cpp
+constexpr explicit vector(size_type n, const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17DefaultInsertable* into `*this`.
 *Effects:* Constructs a `vector` with `n` default-inserted elements
 using the specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
+constexpr vector(size_type n, const T& value,
                  const Allocator& = Allocator());
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* Constructs a `vector` with `n` copies of `value`, using the
 specified allocator.
 *Complexity:* Linear in `n`.
 ``` cpp
 template<class InputIterator>
+ constexpr vector(InputIterator first, InputIterator last,
                    const Allocator& = Allocator());
 ```
 *Effects:* Constructs a `vector` equal to the range \[`first`, `last`),
 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.
+#### Capacity <a id="vector.capacity">[[vector.capacity]]</a>
 ``` cpp
+constexpr size_type capacity() const noexcept;
 ```
 *Returns:* The total number of elements that the vector can hold without
 requiring reallocation.
+*Complexity:* Constant time.
 ``` cpp
+constexpr void reserve(size_type n);
 ```
+*Preconditions:* `T` is *Cpp17MoveInsertable* 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
 if the current capacity is less than the argument of `reserve()`. If an
 exception is thrown other than by the move constructor of a
+non-*Cpp17CopyInsertable* type, there are no effects.
 *Complexity:* It does not change the size of the sequence and takes at
 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, as well as the
+past-the-end iterator.
+[*Note 1*: If no reallocation happens, they remain
+valid. — *end note*]
+No reallocation shall take place during insertions that happen after a
+call to `reserve()` until an insertion would make the size of the vector
+greater than the value of `capacity()`.
 ``` cpp
+constexpr void shrink_to_fit();
 ```
+*Preconditions:* `T` is *Cpp17MoveInsertable* into `*this`.
 *Effects:* `shrink_to_fit` is a non-binding request to reduce
 `capacity()` to `size()`.
+[*Note 2*: The request is non-binding to allow latitude for
 implementation-specific optimizations. — *end note*]
 It does not increase `capacity()`, but may reduce `capacity()` by
 causing reallocation. If an exception is thrown other than by the move
+constructor of a non-*Cpp17CopyInsertable* `T` there are no effects.
+*Complexity:* If reallocation happens, linear in the size of the
+sequence.
 *Remarks:* Reallocation invalidates all the references, pointers, and
 iterators referring to the elements in the sequence as well as the
+past-the-end iterator.
+[*Note 3*: If no reallocation happens, they remain
+valid. — *end note*]
 ``` cpp
+constexpr void swap(vector& x)
   noexcept(allocator_traits<Allocator>::propagate_on_container_swap::value ||
            allocator_traits<Allocator>::is_always_equal::value);
 ```
 *Effects:* Exchanges the contents and `capacity()` of `*this` with that
 of `x`.
 *Complexity:* Constant time.
 ``` cpp
+constexpr void resize(size_type sz);
 ```
+*Preconditions:* `T` is *Cpp17MoveInsertable* and
+*Cpp17DefaultInsertable* into `*this`.
 *Effects:* If `sz < size()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, appends `sz - size()` default-inserted elements
 to the sequence.
 *Remarks:* If an exception is thrown other than by the move constructor
+of a non-*Cpp17CopyInsertable* `T` there are no effects.
 ``` cpp
+constexpr void resize(size_type sz, const T& c);
 ```
+*Preconditions:* `T` is *Cpp17CopyInsertable* into `*this`.
 *Effects:* If `sz < size()`, erases the last `size() - sz` elements from
 the sequence. Otherwise, appends `sz - size()` copies of `c` to the
 sequence.
 *Remarks:* If an exception is thrown there are no effects.
+#### Data <a id="vector.data">[[vector.data]]</a>
 ``` cpp
+constexpr T*         data() noexcept;
+constexpr const T*   data() const noexcept;
 ```
 *Returns:* A pointer such that \[`data()`, `data() + size()`) is a valid
 range. For a non-empty vector, `data()` `==` `addressof(front())`.
 *Complexity:* Constant time.
+#### Modifiers <a id="vector.modifiers">[[vector.modifiers]]</a>
 ``` cpp
+constexpr iterator insert(const_iterator position, const T& x);
+constexpr iterator insert(const_iterator position, T&& x);
+constexpr iterator insert(const_iterator position, size_type n, const T& x);
 template<class InputIterator>
+ constexpr iterator insert(const_iterator position, InputIterator first, InputIterator last);
+constexpr iterator insert(const_iterator position, initializer_list<T>);
+template<class... Args> constexpr reference emplace_back(Args&&... args);
+template<class... Args> constexpr iterator emplace(const_iterator position, Args&&... args);
+constexpr void push_back(const T& x);
+constexpr void push_back(T&& x);
 ```
 *Remarks:* Causes reallocation if the new size is greater than the old
 capacity. Reallocation invalidates all the references, pointers, and
+iterators referring to the elements in the sequence, as well as the
+past-the-end iterator. If no reallocation happens, then references,
+pointers, and iterators before the insertion point remain valid but
+those at or after the insertion point, including the past-the-end
+iterator, are invalidated. 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 *Cpp17CopyInsertable* or
 `is_nothrow_move_constructible_v<T>` is `true`, there are no effects.
 Otherwise, if an exception is thrown by the move constructor of a
+non-*Cpp17CopyInsertable* `T`, the effects are unspecified.
+*Complexity:* If reallocation happens, linear in the number of elements
+of the resulting vector; otherwise, linear in the number of elements
 inserted plus the distance to the end of the vector.
 ``` cpp
+constexpr iterator erase(const_iterator position);
+constexpr iterator erase(const_iterator first, const_iterator last);
+constexpr void pop_back();
 ```
 *Effects:* Invalidates iterators and references at or after the point of
 the erase.
 vector after the erased elements.
 *Throws:* Nothing unless an exception is thrown by the assignment
 operator or move assignment operator of `T`.
+#### Erasure <a id="vector.erasure">[[vector.erasure]]</a>
 ``` cpp
+template<class T, class Allocator, class U>
+ constexpr typename vector<T, Allocator>::size_type
+ erase(vector<T, Allocator>& c, const U& value);
 ```
+*Effects:* Equivalent to:
+``` cpp
+auto it = remove(c.begin(), c.end(), value);
+auto r = distance(it, c.end());
+c.erase(it, c.end());
+return r;
+```
+``` cpp
+template<class T, class Allocator, class Predicate>
+  constexpr typename vector<T, Allocator>::size_type
+    erase_if(vector<T, Allocator>& c, Predicate pred);
+```
+*Effects:* Equivalent to:
+``` cpp
+auto it = remove_if(c.begin(), c.end(), pred);
+auto r = distance(it, c.end());
+c.erase(it, c.end());
+return r;
+```
 ### Class `vector<bool>` <a id="vector.bool">[[vector.bool]]</a>
 To optimize space allocation, a specialization of vector for `bool`
 elements is provided:
 ``` cpp
 namespace std {
   template<class Allocator>
   class vector<bool, Allocator> {
   public:
+    // types
     using value_type             = bool;
     using allocator_type         = Allocator;
     using pointer                = implementation-defined;
     using const_pointer          = implementation-defined;
     using const_reference        = bool;
     using iterator               = implementation-defined  // type of vector<bool>::iterator; // see [container.requirements]
     using const_iterator         = implementation-defined  // type of vector<bool>::const_iterator; // see [container.requirements]
     using reverse_iterator       = std::reverse_iterator<iterator>;
     using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+    // bit reference
     class reference {
       friend class vector;
+ constexpr reference() noexcept;
     public:
+ constexpr reference(const reference&) = default;
+ constexpr ~reference();
+ constexpr operator bool() const noexcept;
+ constexpr reference& operator=(const bool x) noexcept;
+ constexpr reference& operator=(const reference& x) noexcept;
+      constexpr void flip() noexcept;   // flips the bit
     };
+    // construct/copy/destroy
+ constexpr vector() : vector(Allocator()) { }
+ constexpr explicit vector(const Allocator&);
+ constexpr explicit vector(size_type n, const Allocator& = Allocator());
+ constexpr vector(size_type n, const bool& value, const Allocator& = Allocator());
     template<class InputIterator>
+ constexpr vector(InputIterator first, InputIterator last, const Allocator& = Allocator());
+    constexpr vector(const vector& x);
+ constexpr vector(vector&& x);
+ constexpr vector(const vector&, const Allocator&);
+ constexpr vector(vector&&, const Allocator&);
+ constexpr vector(initializer_list<bool>, const Allocator& = Allocator()));
+ constexpr ~vector();
+ constexpr vector& operator=(const vector& x);
+ constexpr vector& operator=(vector&& x);
+ constexpr vector& operator=(initializer_list<bool>);
     template<class InputIterator>
+ constexpr void assign(InputIterator first, InputIterator last);
+ constexpr void assign(size_type n, const bool& t);
+ constexpr void assign(initializer_list<bool>);
+ constexpr allocator_type get_allocator() const noexcept;
+    // iterators
+ constexpr iterator               begin() noexcept;
+ constexpr const_iterator         begin() const noexcept;
+ constexpr iterator               end() noexcept;
+ constexpr const_iterator         end() const noexcept;
+ constexpr reverse_iterator       rbegin() noexcept;
+ constexpr const_reverse_iterator rbegin() const noexcept;
+ constexpr reverse_iterator       rend() noexcept;
+ constexpr const_reverse_iterator rend() const noexcept;
+ constexpr const_iterator         cbegin() const noexcept;
+ constexpr const_iterator         cend() const noexcept;
+ constexpr const_reverse_iterator crbegin() const noexcept;
+ constexpr const_reverse_iterator crend() const noexcept;
+    // capacity
+ [[nodiscard]] constexpr bool empty() const noexcept;
+ constexpr size_type size() const noexcept;
+ constexpr size_type max_size() const noexcept;
+ constexpr size_type capacity() const noexcept;
+ constexpr void      resize(size_type sz, bool c = false);
+ constexpr void      reserve(size_type n);
+ constexpr void      shrink_to_fit();
+    // element access
+ constexpr reference       operator[](size_type n);
+ constexpr const_reference operator[](size_type n) const;
+ constexpr const_reference at(size_type n) const;
+ constexpr reference       at(size_type n);
+ constexpr reference       front();
+ constexpr const_reference front() const;
+ constexpr reference       back();
+ constexpr const_reference back() const;
+    // modifiers
+    template<class... Args> constexpr reference emplace_back(Args&&... args);
+ constexpr void push_back(const bool& x);
+ constexpr void pop_back();
+    template<class... Args> constexpr iterator emplace(const_iterator position, Args&&... args);
+ constexpr iterator insert(const_iterator position, const bool& x);
+ constexpr iterator insert(const_iterator position, size_type n, const bool& x);
     template<class InputIterator>
+ constexpr iterator insert(const_iterator position,
                                 InputIterator first, InputIterator last);
+ constexpr iterator insert(const_iterator position, initializer_list<bool> il);
+ constexpr iterator erase(const_iterator position);
+ constexpr iterator erase(const_iterator first, const_iterator last);
+ constexpr void swap(vector&);
+ constexpr static void swap(reference x, reference y) noexcept;
+ constexpr void flip() noexcept; // flips all bits
+ constexpr void clear() noexcept;
   };
 }
 ```
 Unless described below, all operations have the same requirements and
 semantics as the primary `vector` template, except that operations
 dealing with the `bool` value type map to bit values in the container
+storage and `allocator_traits::construct` [[allocator.traits.members]]
+is not used to construct these values.
 There is no requirement that the data be stored as a contiguous
 allocation of `bool` values. A space-optimized representation of bits is
 recommended instead.
 set, and `false` otherwise. The assignment operator sets the bit when
 the argument is (convertible to) `true` and clears it otherwise. `flip`
 reverses the state of the bit.
 ``` cpp
+constexpr void flip() noexcept;
 ```
 *Effects:* Replaces each element in the container with its complement.
 ``` cpp
+constexpr static void swap(reference x, reference y) noexcept;
 ```
 *Effects:* Exchanges the contents of `x` and `y` as if by:
 ``` cpp
 ``` cpp
 template<class Allocator> struct hash<vector<bool, Allocator>>;
 ```
+The specialization is enabled [[unord.hash]].

Diff to HTML by rtfpessoa